Sciweavers

820 search results - page 130 / 164
» A Search Algorithm for Global Optimisation
Sort
View
95
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
14 years 11 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
CI
2006
94views more  CI 2006»
14 years 11 months ago
Against Optimality: Logical Foundations for Decision-Theoretic Planning in Autonomous Agents
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
John L. Pollock
DAM
2007
94views more  DAM 2007»
14 years 11 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
TCAD
2002
85views more  TCAD 2002»
14 years 11 months ago
Architectural energy optimization by bus splitting
This paper proposes split shared-bus architecture to reduce the energy dissipation for global data exchange among a set of interconnected modules. The bus splitting problem for mi...
Cheng-Ta Hsieh, Massoud Pedram
119
Voted
ACCV
2010
Springer
14 years 6 months ago
Saliency Density Maximization for Object Detection and Localization
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
Ye Luo, Junsong Yuan, Ping Xue, Qi Tian