Sciweavers

708 search results - page 106 / 142
» Timing closure: the solution and its problems
Sort
View
AI
2008
Springer
14 years 10 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
INFOCOM
2009
IEEE
15 years 4 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
ICDCS
2007
IEEE
15 years 4 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
BMCBI
2008
85views more  BMCBI 2008»
14 years 10 months ago
Normalizing biomedical terms by minimizing ambiguity and variability
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
Yoshimasa Tsuruoka, John McNaught, Sophia Ananiado...
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella