1355 search results - page 222 / 271 » Alternating Timed Automata over Bounded Time |
135
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
122
Voted
VLDB
2000
ACM
15 years 7 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
124
Voted
AAAI
2007
15 years 6 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
114
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
132
Voted
SIROCCO
2000
15 years 5 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...