4378 search results - page 153 / 876 » On the Complexity of Ordered Colourings |
200
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
155
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
158
click to vote
MOR
2002
15 years 6 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
199
click to vote
EAAI
2010
15 years 5 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
138
click to vote
IJBC
2006
15 years 6 months ago
2006
We consider several discrete dynamical systems for which some invariants can be found. Our study includes complex M