58 search results - page 7 / 12 » A General Phase Transition Model for Vehicular Traffic |
AAAI
1997
15 years 1 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
FLAIRS
2006
15 years 1 months ago
2006
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...
102
click to vote
DEXA
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Engineering design is a knowledge intensive activity. Design is characterized as comprising a number of phases from requirements to detailed specification. Transitions be...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
85
Voted
ICAI
2003
15 years 1 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...