Sciweavers

2636 search results - page 352 / 528
» Linear Programming
Sort
View
191
Voted
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 7 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
124
Voted
SC
1995
ACM
15 years 7 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
HYBRID
2007
Springer
15 years 10 months ago
Optimal Switches in Multi-inventory Systems
Given a switched multi–inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function relat...
Dario Bauso
125
Voted
WOWMOM
2005
ACM
109views Multimedia» more  WOWMOM 2005»
15 years 9 months ago
On Maximizing Lifetime of a Sensor Cluster
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
Samar Agnihotri, Pavan Nuggehalli, H. S. Jamadagni