1615 search results - page 280 / 323 » Computer science and decision theory |
168
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
274
click to vote
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
132
click to vote
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
142
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
128
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...