Sciweavers

1047 search results - page 168 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AAAI
2006
13 years 9 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
SIGMOD
2007
ACM
161views Database» more  SIGMOD 2007»
14 years 8 months ago
Homeviews: peer-to-peer middleware for personal data sharing applications
This paper presents HomeViews, a peer-to-peer middleware system for building personal data management applications. HomeViews provides abstractions and services for data organizat...
Roxana Geambasu, Magdalena Balazinska, Steven D. G...
PVLDB
2008
126views more  PVLDB 2008»
13 years 7 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
AIRWEB
2008
Springer
13 years 10 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
13 years 8 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu