Sciweavers

1871 search results - page 232 / 375
» The Ephemeral Pairing Problem
Sort
View
TON
1998
186views more  TON 1998»
15 years 6 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
15 years 5 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
INFOCOM
2010
IEEE
15 years 5 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
JELIA
2010
Springer
15 years 5 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...