Sciweavers

4894 search results - page 849 / 979
» Choices
Sort
View
PLDI
2004
ACM
15 years 11 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
SIGCOMM
2004
ACM
15 years 11 months ago
A layered naming architecture for the internet
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature ...
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvi...
WIDM
2004
ACM
15 years 11 months ago
A comprehensive solution to the XML-to-relational mapping problem
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable da...
Sihem Amer-Yahia, Fang Du, Juliana Freire
WOSP
2004
ACM
15 years 11 months ago
Early performance testing of distributed software applications
Performance characteristics, such as response time, throughput and scalability, are key quality attributes of distributed applications. Current practice, however, rarely applies s...
Giovanni Denaro, Andrea Polini, Wolfgang Emmerich
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 11 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze