Sciweavers

1184 search results - page 71 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
IAT
2009
IEEE
15 years 9 months ago
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
Roie Zivan, Robin Glinton, Katia P. Sycara
DATE
2000
IEEE
94views Hardware» more  DATE 2000»
15 years 6 months ago
Shared Memory Implementations of Synchronous Dataflow Specifications
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems. These include tools from academia like Ptolemy [3], and GRAPE [7], and com...
Praveen K. Murthy, Shuvra S. Bhattacharyya
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 3 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
EOR
2007
77views more  EOR 2007»
15 years 2 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
IEEEPACT
2005
IEEE
15 years 8 months ago
Instruction Based Memory Distance Analysis and its Application
Feedback-directed Optimization has become an increasingly important tool in designing and building optimizing compilers as itprovides a means to analyze complexprogram behavior th...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...