Sciweavers

452 search results - page 3 / 91
» A mean field approach for optimization in discrete time
Sort
View
VLDB
1992
ACM
116views Database» more  VLDB 1992»
14 years 15 days ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
CONTEXT
2003
Springer
14 years 1 months ago
Unpacking Meaning from Words: A Context-Centered Approach to Computational Lexicon Design
Abstract. The knowledge representation tradition in computational lexicon design represents words as static encapsulations of purely lexical knowledge. We suggest that this view po...
Hugo Liu
QUESTA
2007
117views more  QUESTA 2007»
13 years 8 months ago
Analyzing a degenerate buffer with general inter-arrival and service times in discrete time
We present the queueing analysis of a degenerate buffer having access to a single server. This system cannot realize any given delay, but only values that are an integer multiple ...
Wouter Rogiest, Koenraad Laevens, Joris Walraevens...
DEDS
2010
157views more  DEDS 2010»
13 years 5 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras
ICANNGA
2007
Springer
105views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Reinforcement Learning in Fine Time Discretization
Reinforcement Learning (RL) is analyzed here as a tool for control system optimization. State and action spaces are assumed to be continuous. Time is assumed to be discrete, yet th...
Pawel Wawrzynski