Sciweavers

3663 search results - page 450 / 733
» Problems in the ontology of computer programs
Sort
View
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
WAE
2001
281views Algorithms» more  WAE 2001»
15 years 8 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
15 years 6 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
CVPR
2011
IEEE
14 years 10 months ago
Global Optimization for Optimal Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
Daniel Pizarro, Adrien Bartoli
DSN
2009
IEEE
16 years 1 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...