Sciweavers

66 search results - page 4 / 14
» Generating exact D-optimal designs for polynomial models
Sort
View
DAC
1998
ACM
15 years 10 months ago
Policy Optimization for Dynamic Power Management
Dynamic power management schemes (also called policies) can be used to control the power consumption levels of electronic systems, by setting their components in different states,...
Giuseppe A. Paleologo, Luca Benini, Alessandro Bog...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICVGIP
2008
14 years 11 months ago
Algebraic Splats Representation for Point Based Models
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
Naveen Kumar Bolla, P. J. Narayanan
ATAL
2005
Springer
15 years 3 months ago
Modeling opponent decision in repeated one-shot negotiations
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
Sabyasachi Saha, Anish Biswas, Sandip Sen
LCTRTS
2004
Springer
15 years 2 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski