920 search results - page 119 / 184 » Computing the Frequency of Partial Orders |
ESA
2007
Springer
15 years 1 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
178
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
90
Voted
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...