Sciweavers

3223 search results - page 111 / 645
» The Scaling of Search Cost
Sort
View
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
15 years 12 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
EPIA
2001
Springer
15 years 11 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona
WWW
2010
ACM
16 years 1 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
UAI
1997
15 years 7 months ago
Perception, Attention, and Resources: A Decision-Theoretic Approach to Graphics Rendering
We describe work to control graphics rendering under limited computational resources by taking a decision-theoretic perspective on perceptual costs and computational savings of ap...
Eric Horvitz, Jed Lengyel
DASFAA
2008
IEEE
125views Database» more  DASFAA 2008»
16 years 26 days ago
A Search Engine for Browsing the Wikipedia Thesaurus
Wikipedia has become a huge phenomenon on the WWW. As a corpus for knowledge extraction, it has various impressive characteristics such as a huge amount of articles, live updates, ...
Kotaro Nakayama, Takahiro Hara, Shojiro Nishio