Sciweavers

2412 search results - page 130 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
113
Voted
AI
1999
Springer
15 years 3 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
AGENTS
1997
Springer
15 years 7 months ago
Increasing Believability in Animated Pedagogical Agents
Animated pedagogical agents o er great promise for knowledge-based learning environments. In addition to coupling feedback capabilities with a strong visual presence, these agents...
James C. Lester, Brian A. Stone
COLT
2007
Springer
15 years 7 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
CSFW
2007
IEEE
15 years 9 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
124
Voted
OOIS
1994
Springer
15 years 7 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson