Sciweavers

7519 search results - page 1262 / 1504
» Optimizing Generic Functions
Sort
View
IDC
2009
Springer
16 years 1 months ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
16 years 1 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
SARA
2009
Springer
16 years 1 months ago
Automated Redesign with the General Redesign Engine
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
Alexander Feldman, Gregory M. Provan, Johan de Kle...
ASPDAC
2009
ACM
155views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Variation-aware resource sharing and binding in behavioral synthesis
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. In the presence of process variations, wo...
Feng Wang 0004, Yuan Xie, Andres Takach
ASPDAC
2009
ACM
122views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Tolerating process variations in high-level synthesis using transparent latches
—Considering process variability at the behavior synthesis level is necessary, because it makes some instances of function units slower and others faster, resulting in unbalanced...
Yibo Chen, Yuan Xie
« Prev « First page 1262 / 1504 Last » Next »