Sciweavers

4595 search results - page 875 / 919
» Reasoning about Plans
Sort
View
PLDI
2003
ACM
14 years 1 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
SIGCOMM
2003
ACM
14 years 1 months ago
Towards an accurate AS-level traceroute tool
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...
Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, R...
SIGECOM
2003
ACM
141views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Automated mechanism design for a self-interested designer
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
SPAA
2003
ACM
14 years 1 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
AI
2003
Springer
14 years 1 months ago
Negotiating Exchanges of Private Information for Web Service Eligibility
Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future par...
Keping Jia, Bruce Spencer