Sciweavers

2150 search results - page 36 / 430
» On a restricted cross-intersection problem
Sort
View
IJCAI
1997
15 years 5 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu
AIPS
1994
15 years 5 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
DAM
2007
94views more  DAM 2007»
15 years 4 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
ADBIS
2005
Springer
116views Database» more  ADBIS 2005»
15 years 10 months ago
A Formal Model for the Problem of View Selection for Aggregate Queries
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
ICALP
2003
Springer
15 years 9 months ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...