Sciweavers

1355 search results - page 222 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 3 months ago
Graph Coloring with Rejection
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...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
VLDB
2000
ACM
163views Database» more  VLDB 2000»
15 years 3 months ago
Hierarchical Compact Cube for Range-Max Queries
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...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
AAAI
2007
15 years 2 months ago
Best-First AND/OR Search for Graphical Models
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 ...
Radu Marinescu 0002, Rina Dechter
CP
2008
Springer
15 years 1 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
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...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
SIROCCO
2000
15 years 1 months ago
Cooperative computing with fragmentable and mergeable groups
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...
Chryssis Georgiou, Alexander A. Shvartsman