Sciweavers

1102 search results - page 6 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
132
Voted
AIPS
1994
15 years 7 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
184
Voted
CI
2011
93views more  CI 2011»
15 years 25 days ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...
136
Voted
IROS
2009
IEEE
137views Robotics» more  IROS 2009»
16 years 14 days ago
Decentralized planning for dynamic motion generation of multi-link robotic systems
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
Yuichi Tazaki, Hisashi Sugiura, Herbert Janssen, C...
107
Voted
KBS
2007
75views more  KBS 2007»
15 years 5 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
194
Voted
AAAI
1994
15 years 7 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex