42 search results - page 7 / 9 » Multi-clock path analysis using propositional satisfiability |
AUTOMATICA
2007
13 years 9 months ago
2007
Abstract: I n this paper, the mapping between the desired camera feature vector and the desired camera pose (i.e., the position, and orientation) is investigated to develop a measu...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
SP
2008
IEEE
14 years 4 months ago
2008
IEEE
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...