16666 search results - page 2593 / 3334 » Descriptive and Computational Complexity |
241
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
208
click to vote
GRID
2008
Springer
15 years 8 months ago
2008
Springer
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
216
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
212
click to vote
BICOB
2010
Springer
15 years 7 months ago
2010
Springer
Biomarker discovery for complex diseases is a challenging problem. Most of the existing approaches identify individual genes as disease markers, thereby missing the interactions a...
230
click to vote
MOBIDE
2010
ACM
15 years 7 months ago
2010
ACM
Complex event detection over data streams has become ubiquitous through the widespread use of sensors, wireless connectivity and the wide variety of end-user mobile devices. Typic...