Sciweavers

351 search results - page 39 / 71
» Perfect Constraints Are Tractable
Sort
View
KR
1989
Springer
13 years 11 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
AIPS
2008
13 years 10 months ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak
ECIR
2003
Springer
13 years 9 months ago
Corpus-Based Thesaurus Construction for Image Retrieval in Specialist Domains
This paper explores the use of texts that are related to an image collection, also known as collateral texts, for building thesauri in specialist domains to aid in image retrieval....
Khurshid Ahmad, Mariam Tariq, Bogdan Vrusias, Chri...
MP
2008
103views more  MP 2008»
13 years 7 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
Adnan Vora, Mikhail Nesterenko, Sébastien T...