Sciweavers

341 search results - page 54 / 69
» Tile-graph-based power planning
Sort
View
AAAI
2008
13 years 10 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
AIPS
2008
13 years 10 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
ICIA
2007
13 years 10 months ago
Modeling Human-Agent Interaction with Active Ontologies
As computer systems continue to grow in power and access more networked content and services, we believe there will be an increasing need to provide more user-centric systems that...
Didier Guzzoni, Charles Baur, Adam Cheyer
FLAIRS
2008
13 years 10 months ago
Recovering from Inconsistency in Distributed Simple Temporal Networks
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
Anthony Gallagher, Stephen F. Smith
FLAIRS
2008
13 years 10 months ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...