Sciweavers

1197 search results - page 198 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
DAC
1997
ACM
14 years 7 days ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
ISMIR
2005
Springer
173views Music» more  ISMIR 2005»
14 years 1 months ago
Audio Matching via Chroma-Based Statistical Features
In this paper, we describe an efficient method for audio matching which performs effectively for a wide range of classical music. The basic goal of audio matching can be describe...
Meinard Müller, Frank Kurth, Michael Clausen
IJSYSC
2006
92views more  IJSYSC 2006»
13 years 8 months ago
Adaptive control of distributed collector solar fields
: Distributed collector solar fields are spatially distributed engineering systems which aim at collecting and storing energy from solar radiation. They are formed by mirrors which...
J. M. Lemos
IJCAI
1997
13 years 9 months ago
Change, Change, Change: Three Approaches
We consider the frame problem, that is, char­ acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
Tom Costello
RTS
2008
134views more  RTS 2008»
13 years 6 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham