Sciweavers

1159 search results - page 42 / 232
» On The Next Move in Programming
Sort
View
187
Voted
CP
2009
Springer
16 years 1 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
RECOMB
2009
Springer
15 years 7 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
101
Voted
ICDAR
2009
IEEE
15 years 7 months ago
Multi-Oriented and Multi-Sized Touching Character Segmentation Using Dynamic Programming
In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
87
Voted
CEC
2007
IEEE
15 years 4 months ago
Double-deck elevator systems using Genetic Network Programming with reinforcement learning
Abstract-- In order to increase the transportation capability of elevator group systems in high-rise buildings without adding elevator installation space, double-deck elevator syst...
Jin Zhou, Lu Yu, Shingo Mabu, Kotaro Hirasawa, Jin...
123
Voted
ANNPR
2006
Springer
15 years 4 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe