Sciweavers

8196 search results - page 441 / 1640
» Computational Modeling and Complexity Science
Sort
View
ACSC
2009
IEEE
16 years 1 months ago
HOPPER: a hierarchical planning agent for unpredictable domains
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...
Maciej Wojnar, Peter Andreae
STACS
2009
Springer
16 years 1 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
CSE
2009
IEEE
16 years 1 months ago
Ranking Comments on the Social Web
— We study how an online community perceives the relative quality of its own user-contributed content, which has important implications for the successful self-regulation and gro...
Chiao-Fang Hsu, Elham Khabiri, James Caverlee
FOCS
2008
IEEE
16 years 1 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
GI
2007
Springer
16 years 1 months ago
EgoIR: Ontology-based Information Retrieval Intended for eGovernment
: The eGovernment is a field of applications for the Semantic Web. The eGovernment also is becoming an important research area and faces considerable challenges to achieve interope...
Fernando Ortiz-Rodríguez, Raúl Palma...