Sciweavers

1047 search results - page 108 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
RTAS
2011
IEEE
12 years 10 months ago
Maximizing Contention-Free Executions in Multiprocessor Scheduling
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
Jinkyu Lee, Arvind Easwaran, Insik Shin
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
13 years 11 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
ECAI
2008
Springer
13 years 9 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...
GBRPR
2007
Springer
13 years 11 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
ECCV
2008
Springer
14 years 9 months ago
Tracking of Abrupt Motion Using Wang-Landau Monte Carlo Estimation
Abstract. We propose a novel tracking algorithm based on the WangLandau Monte Carlo sampling method which efficiently deals with the abrupt motions. Abrupt motions could cause conv...
Junseok Kwon, Kyoung Mu Lee