9888 search results - page 623 / 1978 » Active Algorithm Selection |
214
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
212
click to vote
CN
2010
15 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
199
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
214
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
194
click to vote
COLT
2005
Springer
16 years 29 days ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...