Sciweavers

414 search results - page 81 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
DSN
2005
IEEE
14 years 1 months ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...
ATAL
2010
Springer
13 years 8 months ago
Optimal social laws
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
Thomas Ågotnes, Michael Wooldridge
IPMI
2009
Springer
14 years 1 days ago
Dense Registration with Deformation Priors
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...
TMC
2008
192views more  TMC 2008»
13 years 7 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani