Sciweavers

716 search results - page 51 / 144
» Semilinear Program Feasibility
Sort
View
TE
2010
68views more  TE 2010»
14 years 4 months ago
Remote Spectroscopy in the Visible Using Fibers on the Optical Internet Network
The work presented here demonstrates the feasibility of using the single-mode fibers of an optical Internet network to deliver visible light between separate laboratories as a way ...
Rafael A. S. Ribeiro, Anderson R. de Oliveira, S&e...
MP
2007
76views more  MP 2007»
14 years 9 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
CP
2009
Springer
15 years 10 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
POPL
2008
ACM
15 years 10 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
ICLP
2005
Springer
15 years 3 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...