Sciweavers

804 search results - page 63 / 161
» On the Termination of the Chase Algorithm
Sort
View
NCA
2005
IEEE
15 years 6 months ago
A Wide Area Network Simulation of Single-Round Group Membership Algorithms
A recent theoretical result proposed Sigma, a novel GM protocol that forms views using a singleround of message exchange. Prior GM protocols have required more rounds in the worst...
Roger Khazan, Sophia Yuditskaya
99
Voted
WECWIS
2002
IEEE
130views ECommerce» more  WECWIS 2002»
15 years 5 months ago
A New Category of Business Negotiation Primitives for Bilateral Negotiation Agents and Associated Algorithm to Find Pareto Optim
How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by...
Haifei Li
ASPDAC
2000
ACM
117views Hardware» more  ASPDAC 2000»
15 years 4 months ago
Improved algorithms for hypergraph bipartitioning
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
86
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 19 days ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
100
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu