Sciweavers

1322 search results - page 113 / 265
» Parameterized counting problems
Sort
View
ALENEX
2007
126views Algorithms» more  ALENEX 2007»
13 years 10 months ago
0/1 Vertex and Facet Enumeration with BDDs
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
Markus Behle, Friedrich Eisenbrand
SPIRE
2010
Springer
13 years 7 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
CDC
2008
IEEE
14 years 3 months ago
A Partial order approach to decentralized control
— In this paper we employ the theory of partially ordered sets to model and analyze a class of decentralized control problems. We show that posets provide a natural way of modeli...
Parikshit Shah, Pablo A. Parrilo
ICDT
2003
ACM
126views Database» more  ICDT 2003»
14 years 2 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
14 years 17 days ago
Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
John R. Koza, Martin A. Keane, Jessen Yu, William ...