Sciweavers

528 search results - page 21 / 106
» Computing Large and Small Stable Models
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
GLOBECOM
2009
IEEE
14 years 2 months ago
Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems
— A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where...
Amir Hamed Mohsenian Rad, Vahid Shah-Mansouri, Vin...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
FDL
2005
IEEE
14 years 1 months ago
Synthesis for Unified Control- and Data-Oriented Models
In the Software/Hardware Engineering model-driven design methodology, preservation of real-time system properties can be guaranteed in the model synthesis up to a small time-deviat...
Oana Florescu, Jeroen Voeten, Henk Corporaal
ICCV
1999
IEEE
13 years 12 months ago
What Can Be Determined from a Full and a Weak Perspective Image?
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
Zhengyou Zhang, P. Anandan, Heung-Yeung Shum