Sciweavers

19320 search results - page 45 / 3864
» On the complexity of computing determinants
Sort
View
CORR
2002
Springer
125views Education» more  CORR 2002»
14 years 9 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
EMSOFT
2007
Springer
15 years 3 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
CONEXT
2005
ACM
14 years 11 months ago
Increasing the determinism of network emulation to evaluate communication protocols
In this paper, we propose an emulation solution whose purpose is to deal with the need of reproducibility that is encountered in communication protocols evaluation and transport p...
Emmanuel Conchon, Johan Garcia
IAT
2006
IEEE
15 years 3 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
IEEEIAS
2009
IEEE
15 years 4 months ago
Guess and Determine Attack on SOSEMANUK
SOSEMANUK is a word-oriented stream cipher submitted to the ECRYPT stream cipher project, with a variable-length key between 128 and 256 bits. The algorithm is similar to the strea...
Ding Lin, Guan Jie