Sciweavers

2663 search results - page 50 / 533
» How to Choose a Timing Model
Sort
View
LICS
1994
IEEE
15 years 3 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 3 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
VRML
2004
ACM
15 years 5 months ago
3TP: 3-D models transport protocol
This paper addresses the problem of streaming progressively compressed 3-D models over lossy networks. Out of all encoded packets that can be transmitted, we intelligently choose ...
Ghassan Al-Regib, Yucel Altunbasak
AUTOMATICA
2008
114views more  AUTOMATICA 2008»
14 years 12 months ago
A synthesis approach for output feedback robust constrained model predictive control
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...
ICML
2005
IEEE
16 years 19 days ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore