Sciweavers

6409 search results - page 940 / 1282
» A Computational Algorithm for Origami Design
Sort
View
152
Voted
CN
2007
154views more  CN 2007»
15 years 3 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
157
Voted
CN
2007
148views more  CN 2007»
15 years 3 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
76
Voted
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 3 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
130
Voted
ENTCS
2007
96views more  ENTCS 2007»
15 years 3 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...
121
Voted
EOR
2007
80views more  EOR 2007»
15 years 3 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai