Sciweavers

2354 search results - page 189 / 471
» A Common-Sense Theory of Time
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
FOCS
2004
IEEE
15 years 10 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
EMSOFT
2006
Springer
15 years 10 months ago
Real-time interfaces for composing real-time systems
Recently, a number of frameworks were proposed to extend interface theory to the domains of single-processor and distributed real-time systems. This paper unifies some of these ap...
Lothar Thiele, Ernesto Wandeler, Nikolay Stoimenov
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 10 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...