Sciweavers

5090 search results - page 130 / 1018
» Constructing Strategies for Programming
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
COCOA
2007
Springer
14 years 3 months ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman
DALT
2005
Springer
14 years 2 months ago
An Intensional Programming Approach to Multi-agent Coordination in a Distributed Network of Agents
We explore the suitability of Intensional Programming Paradigm for providing a programming model for coordinated problem solving in a multi-agent systems. We extend our previous wo...
Kaiyu Wan, Vasu S. Alagar
PLDI
1993
ACM
14 years 1 months ago
Dependence-Based Program Analysis
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
Richard Johnson, Keshav Pingali
WWW
2008
ACM
14 years 9 months ago
Towards a programming language for services computing
Services Computing is emerging as a new discipline. The acceptance of web services technology stems from the fact that services enable easy integration and interoperation of enter...
Arun Kumar, D. Janakiram