1431 search results - page 120 / 287 » The complexity of random ordered structures |
184
click to vote
TOPNOC
2008
15 years 6 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...
157
Voted
WEA
2004
Springer
16 years 2 days 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, ...
161
click to vote
IJCAI
2001
15 years 8 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...
190
click to vote
FOCS
2006
IEEE
16 years 24 days 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...
184
click to vote
ICCV
2005
IEEE
16 years 10 days 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...