573 search results - page 72 / 115 » Planning as Satisfiability with Preferences |
IEEECIT
2007
IEEE
14 years 2 months ago
2007
IEEE
The User requirements of many web-based services are dynamically and continuously changing even during the service time itself. For that reason, web service companies always keep ...
IJCAI
2001
13 years 9 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
AAAI
1998
13 years 9 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
CN
2004
13 years 7 months ago
2004
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...