Sciweavers

176 search results - page 34 / 36
» heuristics 1998
Sort
View
VLDB
1998
ACM
82views Database» more  VLDB 1998»
13 years 11 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
VLDB
1998
ACM
108views Database» more  VLDB 1998»
13 years 11 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
NIPS
1998
13 years 8 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
AI
1998
Springer
13 years 7 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 7 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson