Sciweavers

153 search results - page 18 / 31
» An experimental study of greedy routing algorithms
Sort
View
IBIS
2006
109views more  IBIS 2006»
14 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
SASO
2008
IEEE
15 years 4 months ago
On a Self-Organizing MANET Event Routing Architecture with Causal Dependency Awareness
Publish/subscribe (P/S) is a communication paradigm of growing popularity for information dissemination in largescale distributed systems. The strong decoupling between informatio...
Guanhong Pei, Binoy Ravindran, E. Douglas Jensen
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 6 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
SP
2002
IEEE
139views Security Privacy» more  SP 2002»
14 years 9 months ago
Mobile objects in Java
Mobile Objects in Java provides support for object mobility in Java. Similarly to the RMI technique, a notion of client-side stub, called startpoint, is used to communicate transp...
Luc Moreau, Daniel Ribbens
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 4 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad