Sciweavers

89222 search results - page 101 / 17845
» Which
Sort
View
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 7 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
AIPS
2009
15 years 7 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
162
Voted
ICFP
2010
ACM
15 years 7 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
APAL
2010
81views more  APAL 2010»
15 years 6 months ago
Proof and refutation in MALL as a game
We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of
Olivier Delande, Dale Miller, Alexis Saurin
CGF
2010
135views more  CGF 2010»
15 years 6 months ago
Designing Quad-dominant Meshes with Planar Faces
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...
« Prev « First page 101 / 17845 Last » Next »