833 search results - page 72 / 167 » Simpler and better approximation algorithms for network desi... |
135
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
126
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
Wireless mesh networks (WMNs) are one of the key features of beyond 3G system because of their flexible and lowcost deployment. IEEE 802.16 mesh mode has recently emerged as an alt...
145
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
130
click to vote
CIBCB
2007
IEEE
15 years 10 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
139
Voted
ESANN
2007
15 years 5 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...