42230 search results - page 208 / 8446 » Algorithms and Complexity Results for |
164
click to vote
ECCC
2006
15 years 6 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
183
click to vote
AAAI
1996
15 years 7 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
166
click to vote
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
15 years 4 months 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...
200
click to vote
ASPDAC
2000
ACM
15 years 11 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
156
click to vote
AIPS
2003
15 years 8 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...