Sciweavers

1639 search results - page 266 / 328
» Anytime Heuristic Search
Sort
View
PERCOM
2007
ACM
14 years 8 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
CVPR
2010
IEEE
14 years 4 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
EVOW
2010
Springer
14 years 3 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
CP
2009
Springer
14 years 3 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
14 years 3 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held