Sciweavers

3864 search results - page 141 / 773
» time 2005
Sort
View
CSCLP
2005
Springer
15 years 12 months ago
Complexity Analysis of Heuristic CSP Search Algorithms
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
Igor Razgon
ISQED
2005
IEEE
95views Hardware» more  ISQED 2005»
15 years 12 months ago
Statistical Analysis of Clock Skew Variation in H-Tree Structure
This paper discusses clock skew due to manufacturing variability and environmental change. In clock tree design, transition time constraint is an important design parameter that c...
Masanori Hashimoto, Tomonori Yamamoto, Hidetoshi O...
AUTOMATICA
2005
116views more  AUTOMATICA 2005»
15 years 6 months ago
Monotonically convergent iterative learning control for linear discrete-time systems
In iterative learning control schemes for linear discrete time systems, conditions to guarantee the monotonic convergence of the tracking9 error norms are derived. By using the Ma...
Kevin L. Moore, Yangquan Chen, Vikas Bahl
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
15 years 12 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
CODES
2005
IEEE
16 years 20 hour ago
Energy conscious online architecture adaptation for varying latency constraints in sensor network applications
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
Sankalp Kallakuri, Alex Doboli