Sciweavers

2661 search results - page 353 / 533
» Quantum Complexity Classes
Sort
View
163
Voted
RE
2010
Springer
14 years 10 months ago
Effort and Quality of Recovering Requirements-to-Code Traces: Two Exploratory Experiments
Trace links between requirements and code are essential for many software development and maintenance activities. Despite significant advances in traceability research, creating li...
Alexander Egyed, Florian Graf, Paul Grünbache...
117
Voted
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
15 years 10 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
138
Voted
ATAL
2009
Springer
15 years 10 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
143
Voted
ICALP
2007
Springer
15 years 9 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
136
Voted
ICN
2005
Springer
15 years 9 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao