Sciweavers

2976 search results - page 245 / 596
» On the bounded integer programming
Sort
View
SCAM
2007
IEEE
15 years 11 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
ENTCS
2006
105views more  ENTCS 2006»
15 years 5 months ago
Feasible Reactivity for Synchronous Cooperative Threads
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
Roberto M. Amadio, Frédéric Dabrowsk...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
A Translational Approach to Constraint Answer Set Solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
Christian Drescher, Toby Walsh
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 10 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
INFOCOM
1998
IEEE
15 years 9 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan