840 search results - page 131 / 168 » Inapproximability of Combinatorial Optimization Problems |
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
AI
2001
Springer
14 years 3 months ago
2001
Springer
Reinforcement learning techniques are increasingly being used to solve di cult problems in control and combinatorial optimization with promising results. Implicit imitation can acc...
PPDP
1999
Springer
14 years 3 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
BIBE
2007
IEEE
14 years 24 days ago
2007
IEEE
In this paper we describe our design and characterization of a co-processor architecture to accelerate median-based phylogenetic reconstruction for generearrangement data. Our curr...
DAGSTUHL
2007
14 years 13 days ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...