Sciweavers

1291 search results - page 60 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
Study of Self-Organization Model of Multiple Mobile Robot
: A good organization model of multiple mobile robot should be able to improve the efficiency of the system, reduce the complication of robot interactions, and detract the difficul...
Cheng Xian-Yi, Li Shu-Qin, Xian De-Shen
ICRA
2006
IEEE
118views Robotics» more  ICRA 2006»
14 years 1 months ago
Symbolic Control for Underactuated Differentially Flat Systems
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
Adriano Fagiolini, Luca Greco, Antonio Bicchi, Ben...