Sciweavers

407 search results - page 23 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
DAC
2003
ACM
14 years 8 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
CVPR
2011
IEEE
13 years 3 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
BMCBI
2004
138views more  BMCBI 2004»
13 years 7 months ago
Constraint Logic Programming approach to protein structure prediction
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
Alessandro Dal Palù, Agostino Dovier, Feder...
EUROGP
2003
Springer
259views Optimization» more  EUROGP 2003»
14 years 23 days ago
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 7 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler