Sciweavers

503 search results - page 80 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
120
Voted
COR
2004
111views more  COR 2004»
15 years 3 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
149
Voted
COMSWARE
2007
IEEE
15 years 9 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
111
Voted
SIGCOMM
1999
ACM
15 years 7 months ago
On Estimating End-to-End Network Path Properties
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
Mark Allman, Vern Paxson
92
Voted
JEA
2006
90views more  JEA 2006»
15 years 3 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
JSAT
2010
132views more  JSAT 2010»
14 years 10 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres