Sciweavers

7167 search results - page 835 / 1434
» Answer Set Programming
Sort
View
COR
2007
108views more  COR 2007»
15 years 6 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
ENTCS
2007
128views more  ENTCS 2007»
15 years 6 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
ML
2008
ACM
15 years 6 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
ESE
2007
124views Database» more  ESE 2007»
15 years 6 months ago
A study of effectiveness of dynamic slicing in locating real faults
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Neelam Gupta, Rajiv Gupta