Sciweavers

4850 search results - page 201 / 970
» Proof and Computation in Geometry
Sort
View
ICFEM
2003
Springer
15 years 11 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
WINE
2010
Springer
148views Economy» more  WINE 2010»
15 years 4 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...
TOG
2008
120views more  TOG 2008»
15 years 6 months ago
Markerless garment capture
A lot of research has recently focused on the problem of capturing the geometry and motion of garments. Such work usually relies on special markers printed on the fabric to establ...
Derek Bradley, Tiberiu Popa, Alla Sheffer, Wolfgan...
ECCC
2007
90views more  ECCC 2007»
15 years 6 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider