Sciweavers

1578 search results - page 97 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
COR
2008
122views more  COR 2008»
13 years 9 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
PVLDB
2010
118views more  PVLDB 2010»
13 years 7 months ago
Global Detection of Complex Copying Relationships Between Sources
Web technologies have enabled data sharing between sources but also simplified copying (and often publishing without proper attribution). The copying relationships can be complex...
Xin Dong, Laure Berti-Equille, Yifan Hu, Divesh Sr...
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
ICCAD
2005
IEEE
118views Hardware» more  ICCAD 2005»
14 years 5 months ago
Thermal via planning for 3-D ICs
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
Jason Cong, Yan Zhang
DLOG
2006
13 years 10 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter