Sciweavers

1523 search results - page 78 / 305
» The Computational Complexity of Linear Optics
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
ICRA
2005
IEEE
259views Robotics» more  ICRA 2005»
14 years 2 months ago
Flexible Microscope Calibration using Virtual Pattern for 3-D Telemicromanipulation
Abstract— In the context of virtualized reality based telemicromanipulation, we present in this paper a visual calibration technique for optical microscope coupled with a CCD cam...
Mehdi Ammi, Vincent Frémont, Antoine Ferrei...
ENDM
2010
101views more  ENDM 2010»
13 years 9 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
CODES
2006
IEEE
13 years 11 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...