4110 search results - page 226 / 822 » Efficient algorithms for the 2-gathering problem |
181
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
173
click to vote
INFOCOM
2006
IEEE
16 years 17 days ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
155
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
161
click to vote
AAAI
2006
15 years 8 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
141
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...