Sciweavers

107 search results - page 21 / 22
» Dynamic Management of Heuristics for Solving Structured CSPs
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 9 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
IJCAI
2003
13 years 8 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
DBISP2P
2003
Springer
105views Database» more  DBISP2P 2003»
14 years 7 days ago
Distributed Queries and Query Optimization in Schema-Based P2P-Systems
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer-to-peer (P2P) networks, similar approaches are just beginning to emerge,...
Ingo Brunkhorst, Hadhami Dhraief, Alfons Kemper, W...
OOPSLA
2004
Springer
14 years 11 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...
ATAL
2005
Springer
14 years 17 days ago
From team plan to individual plans: a petri net-based approach
This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit...
Olivier Bonnet-Torrés, Catherine Tessier