1225 search results - page 100 / 245 » The Instance Complexity Conjecture |
ICPP
1995
IEEE
14 years 20 days ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
IASTEDSE
2004
13 years 10 months ago
2004
The notion of service enjoys increasing popularity as a means for structuring complex distributed systems. Most definitions of the term service, however, refer only to syntactic l...
IJCAI
1993
13 years 10 months ago
1993
The situation recognition system, to which this paper is devoted, receives as input a stream of time-stamped events; it performs recognition of instances of occurring situations, ...
ANOR
2008
13 years 9 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...