1013 search results - page 104 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
123
click to vote
SARA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
113
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
122
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
114
Voted
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
15 years 17 days ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
259
click to vote
Publication
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...