1289 search results - page 178 / 258 » Complexity of Counting the Optimal Solutions |
153
Voted
ICANNGA
2009
Springer
16 years 14 days ago
2009
Springer
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
201
click to vote
INFOCOM
2008
IEEE
16 years 9 days ago
2008
IEEE
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
179
click to vote
IPPS
2007
IEEE
16 years 6 days ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
161
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
176
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...