Sciweavers

1301 search results - page 3 / 261
» Specifications via Realizability
Sort
View
NETWORKS
2008
13 years 5 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
13 years 11 months ago
System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...
Zhun Fan, Kisung Seo, Jianjun Hu, Ronald C. Rosenb...
CORR
2011
Springer
137views Education» more  CORR 2011»
13 years 23 days ago
Existential witness extraction in classical realizability and via a negative translation
Abstract. We show how to extract existential witnesses from classical proofs using Krivine’s classical realizability—where classical proofs are interpreted as λ-terms with the...
Alexandre Miquel
PUK
2001
13 years 7 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
VC
2008
162views more  VC 2008»
13 years 5 months ago
Realization of Seurat's pointillism via non-photorealistic rendering
Photorealistic rendering is one of the oldest and most important research areas in computer graphics. More recently, the concept of nonphotorealistic rendering has been proposed as...
Chuan-Kai Yang, Hui-Lin Yang