Sciweavers

250 search results - page 41 / 50
» The complexity of temporal constraint satisfaction problems
Sort
View
AAAI
2000
15 years 1 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CP
2006
Springer
15 years 3 months ago
Interactive Distributed Configuration
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henne...
IJCAI
2007
15 years 1 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
96
Voted
KBSE
1997
IEEE
15 years 3 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
97
Voted
VLDB
2002
ACM
156views Database» more  VLDB 2002»
14 years 11 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu