Sciweavers

810 search results - page 101 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ICWE
2003
Springer
14 years 1 months ago
Genre and Domain Processing in an Information Retrieval Perspective
Abstract. The massive amount of textual data on the Web raises numerous classification problems. Although the notion of domain is widely acknowledged in the IR field, the applica...
Céline Poudat, Guillaume Cleuziou
SAT
2004
Springer
109views Hardware» more  SAT 2004»
14 years 1 months ago
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
Alessandro Armando, Claudio Castellini, Enrico Giu...
AAAI
2007
13 years 10 months ago
Forgetting Actions in Domain Descriptions
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
Esra Erdem, Paolo Ferraris
JUCS
2008
135views more  JUCS 2008»
13 years 8 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
ATAL
2003
Springer
14 years 1 months ago
Continual coordination through shared activities
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...
Bradley J. Clement, Anthony C. Barrett