Sciweavers

10493 search results - page 140 / 2099
» Dynamic Word Problems
Sort
View
IJCGA
2006
85views more  IJCGA 2006»
13 years 8 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
IPL
2007
130views more  IPL 2007»
13 years 8 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
ORL
2007
61views more  ORL 2007»
13 years 7 months ago
Exact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 24 days ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...
FIW
2007
123views Communications» more  FIW 2007»
13 years 9 months ago
Composing Features by Managing Inconsistent Requirements
Abstract. One approach to system development is to decompose the requirements into features and specify the individual features before composing them. A major limitation of deferri...
Robin C. Laney, Thein Than Tun, Michael Jackson, B...