808 search results - page 93 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
JSS
2010
14 years 4 months ago
2010
Software product-lines (SPLs) are software architectures that can be readily reconfigured for different project requirements. A key part of an SPL is a model that captures the rul...
118
click to vote
AI
2012
Springer
13 years 5 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
AI
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...