Sciweavers

696 search results - page 91 / 140
» A class of combinatorial identities
Sort
View
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
16 years 3 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
COMPGEOM
2009
ACM
16 years 24 days ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
APN
2008
Springer
15 years 8 months ago
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
Morgan Magnin, Didier Lime, Olivier H. Roux
LICS
2010
IEEE
15 years 4 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...