2542 search results - page 264 / 509 » Computing Cartograms with Optimal Complexity |
112
Voted
CA
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents an interactive hierarchical motion control system dedicated to the animation of human figure locomotion in virtual environments. As observed in gait experiment...
133
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
135
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
115
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
99
Voted
JAIR
2006
15 years 15 days ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...