Exact Algorithms for

[1]  Leslie Ann Goldberg,et al.  COUNTING UNLABELLED SUBTREES OF A TREE IS #P-COMPLETE , 2000 .

[2]  Ulf Seigerroth,et al.  Att förstå och förändra systemutvecklingsverksamheter en taxonomi för metautveckling , 2003 .

[3]  Tobias Ritzau,et al.  Memory Efficient Hard Real-Time Garbage Collection , 2003 .

[4]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[5]  Henryk Jan Komorowski,et al.  A specification of an abstract Prolog machine and its application to partial evaluation , 1981 .

[6]  Eva L. Ragnemalm,et al.  Student modelling based on collaborative dialogue with a learning companion , 1999 .

[7]  Claudiu Duma,et al.  Security and trust mechanisms for groups in distributed services , 2005 .

[8]  Ling Lin,et al.  Management of 1-D Sequence Data- From Discrete to Continuous , 1999 .

[9]  Edith Hemaspaandra,et al.  Nondeterminism fairness and a fundamental analogy , 1989, Bull. EATCS.

[10]  Bolette Ammitzbøll Jurik,et al.  New algorithms for Exact Satisfiability , 2003, Theor. Comput. Sci..

[11]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[12]  Iakov Nakhimovski,et al.  Contributions to the Modeling and Simulation of Mechanical Systems with Detailed Contact Analyses , 2006 .

[13]  Ola Angelsmark.  Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications , 2005 .

[14]  Bolette Ammitzbøll Madsen.  An algorithm for exact satisfiability analysed with the number of clauses as parameter , 2006 .

[15]  Fredrik Karlsson,et al.  Method configuration: method and computerized tool support , 2005 .

[16]  Jörgen Lindström,et al.  Does distance matter? On geographical dispersion in organisations , 1999 .

[17]  Jörgen Hansson,et al.  Value-driven multi-class overload management in real-time database systems , 1999 .

[18]  Vilhelm Dahllöf.  Applications of General Exact Satisfiability in Propositional Logic Modelling , 2004, LPAR.

[19]  Niklas Hallberg,et al.  Incorporating user values in the design of information systems and services in the public sector : a methods approach , 1999 .

[20]  Lars Hult,et al.  Publika informationstjänster : en studie av den elektroniska encyklopedins bruksegenskaper , 2003 .

[21]  Barry O'Sullivan,et al.  Finding Diverse and Similar Solutions in Constraint Programming , 2005, AAAI.

[22]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[23]  Jaime Villegas,et al.  Simulation supported industrial training from an organisational learning perspective : development and evaluation of the SSIT method , 1996 .

[24]  Nahid Shahmehri,et al.  Generalized algorithmic debugging , 1991 .

[25]  Oliver Kullmann,et al.  New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[26]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[27]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[28]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[29]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[30]  Olivier Dubois,et al.  Counting the Number of Solutions for Instances of Satisfiability , 1991, Theor. Comput. Sci..

[31]  Wenhui Zhang,et al.  Number of Models and Satisfiability of Sets of Clauses , 1996, Theor. Comput. Sci..

[32]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[33]  Lars Degerstedt,et al.  Tabulation-based Logic Programming : A Multi-level View of Query Answering , 1996 .

[34]  Gianluca Rossi,et al.  On the Hamming distance of constraint satisfaction problems , 2002, Theor. Comput. Sci..

[35]  N. Dahlbäck,et al.  Representations of discourse : cognitive and computational aspects , 1991 .

[36]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[37]  Pär Emanuelson,et al.  Performance enhancement in a well-structured pattern matcher through partial evaluation , 1980 .

[38]  Lin Padgham,et al.  Non-monotonic inheritance for an object-oriented knowledge-base , 1989 .

[39]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[40]  Vilhelm Dahllöf.  Algorithms for Max Hamming Exact Satisfiability , 2005, ISAAC.

[41]  Sorin Manolache,et al.  Analysis and Optimisation of Real-Time Systems with Stochastic Behaviour , 2005 .

[42]  Sofie Pilemalm,et al.  Information Technology for Non-Profit Organisations: Extended Participatory Design of an Information System for Trade Union Shop Stewards , 2002 .

[43]  Asmus Pandikow,et al.  A Generic Principle for Enabling Interoperability of Structured and Object-Oriented Analysis and Design Tools , 2002 .

[44]  Stefan Porschen.  On Some Weighted Satisfiability and Graph Problems , 2005, SOFSEM.

[45]  Rego Granlund,et al.  Monitoring distributed teamwork training , 2002 .

[46]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[47]  Jinbo Huang,et al.  MUP: a minimal unsatisfiability prover , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[48]  Sture Hägglund,et al.  Contributions to the development of methods and tools for interactive design of applications software , 1980 .

[49]  Joachim Karlsson,et al.  A systematic approach for prioritizing software requirements , 1998 .

[50]  Mikael Ericsson,et al.  Supporting the use of design knowledge : an assessment of commenting agents , 1999 .

[51]  Evgeny Dantsin,et al.  Algorithms for SAT Based on Search in Hamming Balls , 2004, STACS.

[52]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[53]  Pär J. Ågerfalk.  Information Systems Actability: Understanding Information Technology as a Tool for Business Action and Communication , 2003 .

[54]  Linda Askenäs,et al.  The roles of IT : studies of organising when implementing and using enterprise systems , 2004 .

[55]  Luis Alejandro Cortés,et al.  Verification and Scheduling Techniques for Real-Time Embedded Systems , 2005 .

[56]  Bourhane Kadmiry,et al.  Fuzzy gain scheduled visual servoing for an unmanned helicopter , 2005 .

[57]  Chu Min Li,et al.  Integrating Equivalency Reasoning into Davis-Putnam Procedure , 2000, AAAI/IAAI.

[58]  David Dinka,et al.  Role, Identity and Work : Extending the design and development agenda , 2010 .

[59]  Anders Avdic,et al.  Användare och utvecklare : om anveckling med kalkylprogram , 2001 .

[60]  Stefan Holmlid,et al.  Adapting users : towards a theory of use quality , 2002 .

[61]  Peter Ambjorn Fritzson,et al.  Towards a distributed programming environment based on incremental compilation (debugging, prettyprinting, interactive) , 1984 .

[62]  Ewa Braf,et al.  Knowledge demanded for action : studies of knowledge mediation in organisations , 2004 .

[63]  Rita Kovordanyi,et al.  Modeling and simulating inhibitory mechanisms in mental image reinterpretation : towards cooperative human-computer creativity , 1999 .

[64]  Choong-ho Yi,et al.  Modelling object-oriented dynamic systems using a logic-based framework , 2002 .

[65]  Silvia Coradeschi,et al.  Anchoring symbols to sensory data , 1999 .

[66]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[67]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[68]  Magnus Merkel,et al.  Understanding and enhancing translation by parallel text processing , 1999 .

[69]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[70]  P. Doherty.  NML3 : a non-monotonic formalism with explicit defaults , 1991 .

[71]  Catherine S. Greenhill.  The complexity of counting colourings and independent sets in sparse graphs and hypergraphs , 2000, computational complexity.

[72]  Alvaro del Val.  On 2-SAT and Renamable Horn , 2000, AAAI/IAAI.

[73]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[74]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[75]  Jianer Chen,et al.  Improved exact algorithms for MAX-SAT , 2002, Discret. Appl. Math..

[76]  Peter Rossmanith,et al.  Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms , 2004 .

[77]  Yuxiao Zhao,et al.  Standards-based application integration for business-to-business communications , 2005 .

[78]  Aleksandra Tesanovic,et al.  Developing Reusable and Reconfigurable Real-Time Software using Aspects and Components , 2006 .

[79]  Henrik Nilsson,et al.  Declarative debugging for lazy functional languages , 1998 .

[80]  Carl-Johan Petri,et al.  Organizational information provision : managing mandatory and discretionary utilization of information technology , 2001 .

[81]  Anneli Hagdahl,et al.  Development of IT-supported Inter-organisational Collaboration: A Case Study in the Swedish Public Sector , 2002 .

[82]  Peter Jonsson,et al.  An algorithm for counting maximum weighted independent sets and its applications , 2002, SODA '02.

[83]  Harry B. Hunt,et al.  The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..

[84]  Maria J. Serna,et al.  Counting H-colorings of partial k-trees , 2001, Theor. Comput. Sci..

[85]  Johan Åberg,et al.  Live help systems : an approach to intelligent help for Web information systems , 2002 .

[86]  Miroslaw Truszczynski,et al.  Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints , 2003, CP.

[87]  Juha Takkinen,et al.  From information management to task management in electronic mail , 2002 .

[88]  Pawel Pietrzak,et al.  A type-based framework for locating errors in constraint logic programs , 2002 .

[89]  C. Curescu,et al.  Utility-based Optimisation of Resource Allocation for Wireless Networks , 2005 .

[90]  Stefan Cronholm,et al.  Metodverktyg och användbarhet : en studie av datorstödd metodbaserad systemutveckling , 1998 .

[91]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[92]  Jonas Mellin,et al.  Resource-Predictable and Efficient Monitoring of Events , 2004 .

[93]  Ulf Nilsson,et al.  Abstract Interpretation & Abstract Machines: Contribution to a Methodology for the Implementation of Logic Programs , 1992 .

[94]  Erik G. Larsson,et al.  An Integrated System-Level Design for Testability Methodology , 2000 .

[95]  Osten Oskarsson,et al.  Mechanisms of modifiability in large software systems , 1982 .

[96]  Tore Risch,et al.  Compilation of multiple file queries in a meta-database system , 1978 .

[97]  Magnus Wahlström,et al.  Counting models for 2SAT and 3SAT formulae , 2005, Theor. Comput. Sci..

[98]  Mikael Cäker,et al.  Management accounting as constructing and opposing customer focus : three case studies on management accounting and customer relations , 2005 .

[99]  Pernilla Qvarfordt,et al.  Eyes on multimodal interaction , 2004 .

[100]  Gert Jervan,et al.  Hybrid Built-In Self-Test and Test Generation Techniques for Digital Systems , 2005 .

[101]  Fabrizio Grandoni,et al.  Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.

[102]  Erik Anders Tengvald,et al.  The design of expert planning systems: an experimental operations planning system for turning , 1984 .

[103]  Mikael Lind,et al.  Från system till process kriterier för processbestämning vid verksamhetsanalys , 2001 .

[104]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[105]  Vivian Vimarlund,et al.  An economic perspective on the analysis of impacts of information technology : from case studies in health-care towards general models and theories , 1999 .

[106]  Martin Fürer,et al.  Algorithms for Counting 2-SAT Solutions and Colorings with Applications , 2005, Electron. Colloquium Comput. Complex..

[107]  Jonas Hallberg,et al.  Timing issues in high-level synthesis , 1998 .

[108]  David Peleg,et al.  Faster exact solutions for some NP-hard problems , 2002, Theor. Comput. Sci..

[109]  Diana Szentiványi.  Performance Studies of Fault-Tolerant Middleware , 2005 .

[110]  Anders Arpteg,et al.  Intelligent Semi-Structured Information Extraction , 2005 .

[111]  Joakim Gustafsson,et al.  Extending temporal action logic , 2001 .

[112]  Dimiter Driankov,et al.  Towards a many‐valued logic of quantified belief: The information lattice , 1991 .

[113]  Erland Jungert,et al.  Synthesizing database structures from a user oriented data model , 1980 .

[114]  Mikael Kindborg,et al.  Concurrent comics : programming of social agents by children , 2003 .

[115]  Annika Flycht-Eriksson,et al.  Design and use of ontologies in information-providing dialogue systems , 2004 .

[116]  Jimmy Tjäder,et al.  Systemimplementering i praktiken : en studie av logiker i fyra projekt , 1999 .