Sciweavers

1529 search results - page 233 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
C3S2E
2010
ACM
13 years 10 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
MICCAI
2005
Springer
14 years 9 months ago
Shape Modeling Using Automatic Landmarking
Abstract. This paper describes a novel approach to automatically recover accurate correspondence over various shapes. In order to detect the features points with the capability in ...
Jun Xie, Pheng-Ann Heng
ICRA
2007
IEEE
150views Robotics» more  ICRA 2007»
14 years 3 months ago
A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
14 years 17 days ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...