Sciweavers

3708 search results - page 98 / 742
» Approximating Betweenness Centrality
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 6 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
107
Voted
CA
2002
IEEE
15 years 5 months ago
Randomly Accessible Procedural Animation of Physically Approximate Turbulent Motion
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
Hui Fang, John C. Hart
109
Voted
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 5 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai
108
Voted
SIGDIAL
2010
14 years 10 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 10 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...