Sciweavers

14158 search results - page 205 / 2832
» Generalized switch-setting problems
Sort
View
CSL
2007
Springer
15 years 7 months ago
Logical Refinements of Church's Problem
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
Alexander Rabinovich, Wolfgang Thomas
123
Voted
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 6 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
104
Voted
IJFCS
2008
121views more  IJFCS 2008»
15 years 3 months ago
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...
Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-...
150
Voted
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 3 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
152
Voted
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
15 years 10 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