Sciweavers

750 search results - page 98 / 150
» Desires, Norms and Constraints
Sort
View
CP
2005
Springer
15 years 7 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
SIGGRAPH
1999
ACM
15 years 6 months ago
Shape Transformation Using Variational Implicit Functions
Traditionally, shape transformation using implicit functions is performed in two distinct steps: 1) creating two implicit functions, and 2) interpolating between these two functio...
Greg Turk, James F. O'Brien
CP
2006
Springer
15 years 5 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
DS
1992
128views Database» more  DS 1992»
15 years 3 months ago
Achieving Incremental Consistency among Autonomous Replicated Databases
In this paper, we present methods for supporting autonomous updates in replicated databases. Autonomous updates are of particular importance to applications that cannot tolerate t...
Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Kel...
AIPS
2009
15 years 3 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...