7519 search results - page 444 / 1504 » Optimizing Generic Functions |
163
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
216
click to vote
ECML
2007
Springer
15 years 8 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
154
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
183
click to vote
IJAIT
2002
15 years 6 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
193
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...