376 search results - page 55 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
IEICET
2006
15 years 1 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
105
Voted
IEAAIE
2001
Springer
15 years 6 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
135
click to vote
IAT
2009
IEEE
15 years 8 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
135
Voted
BMCBI
2008
15 years 1 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
110
click to vote
COMCOM
2007
15 years 1 months ago
2007
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...