697 search results - page 60 / 140 » On the Theory of Average Case Complexity |
ESM
1998
13 years 9 months ago
1998
This paper aims to and illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry, which are...
CACM
1998
13 years 7 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
CASES
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents and reports on a VLIW code compression technique based on vector Hamming distances [19]. It investigates the appropriate selection of dictionary vectors such t...