Sciweavers

2095 search results - page 390 / 419
» Improved pebbling bounds
Sort
View
ATAL
2009
Springer
14 years 4 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
BTW
2009
Springer
114views Database» more  BTW 2009»
14 years 4 months ago
Value Demonstration of Embedded Analytics for Front Office Applications
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...
Erik Nijkamp, Martin Oberhofer, Albert Maier
ESA
2009
Springer
99views Algorithms» more  ESA 2009»
14 years 4 months ago
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Chandra Chekuri, Sungjin Im, Benjamin Moseley
ESWS
2009
Springer
14 years 4 months ago
A Reasoning-Based Support Tool for Ontology Mapping Evaluation
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
Christian Meilicke, Heiner Stuckenschmidt, Ondrej ...
FSTTCS
2009
Springer
14 years 4 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...