Sciweavers

14386 search results - page 225 / 2878
» The Chinese Generals Problem
Sort
View
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 4 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
15 years 11 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
CAV
2003
Springer
127views Hardware» more  CAV 2003»
15 years 8 months ago
Dense Counter Machines and Verification Problems
We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and te...
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi S...
JCT
2008
59views more  JCT 2008»
15 years 4 months ago
Partition identities and the coin exchange problem
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
Alexander E. Holroyd
105
Voted
EOR
2002
68views more  EOR 2002»
15 years 4 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski