Sciweavers

1184 search results - page 120 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
115
Voted
AAAI
2008
15 years 5 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
INFOCOM
1994
IEEE
15 years 6 months ago
Optimal Multiplexing on a Single Link: Delay and Buffer Requirements
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
Leonidas Georgiadis, Roch Guérin, Abhay K. ...
117
Voted
ANCS
2007
ACM
15 years 6 months ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang
132
Voted
SIGMOD
2000
ACM
158views Database» more  SIGMOD 2000»
15 years 7 months ago
NiagaraCQ: A Scalable Continuous Query System for Internet Databases
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wan...
134
Voted
JCP
2007
243views more  JCP 2007»
15 years 2 months ago
Adaptive-Gain Kinematic Filters of Orders 2-4
- The kinematic filter is a common tool in control and signal processing applications dealing with position, velocity and other kinematical variables. Usually the filter gain is gi...
Naum Chernoguz