Sciweavers

11565 search results - page 179 / 2313
» Computing Minimal Mappings
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
15 years 4 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
SAC
2008
ACM
15 years 4 months ago
Test generation and minimization with "basic" statecharts
Model-based testing as a black-box testing technique has grown in importance. The models used represent the relevant features of the system under consideration (SUC), and can also...
Fevzi Belli, Axel Hollmann
PODC
2005
ACM
15 years 10 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
ATAL
2010
Springer
15 years 5 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
VLSISP
2002
112views more  VLSISP 2002»
15 years 4 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai