2355 search results - page 463 / 471 » Scheduling in the Z-Polyhedral Model |
IJCAI
2001
14 years 11 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
ECIS
2003
14 years 11 months ago
2003
During the last decade, teams working on information technology (IT) development and implementation projects have experienced significant transformations. Nowadays, many members o...
ACL
1998
14 years 11 months ago
1998
In this paper, we report on an effort to provide a general-purpose spoken language generation tool for Concept-to-Speech (CTS) applications by extending a widely used text generat...
108
click to vote
AAAI
1994
14 years 11 months ago
1994
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...
103
click to vote
AIPS
2009
14 years 10 months ago
2009
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...