1431 search results - page 120 / 287 » The complexity of random ordered structures |
127
click to vote
TOPNOC
2008
15 years 3 months ago
2008
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
113
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
110
click to vote
IJCAI
2001
15 years 4 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
132
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
123
click to vote
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...