3775 search results - page 138 / 755 » The Expression Problem Revisited |
115
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper revisits the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Se...
128
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
137
Voted
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
138
Voted
QSIC
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
150
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...