Sciweavers

2771 search results - page 484 / 555
» A General Computational Treatment of the Comparative
Sort
View
117
Voted
FOCS
2008
IEEE
15 years 2 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
GECCO
2008
Springer
199views Optimization» more  GECCO 2008»
15 years 2 months ago
Analysis of multi-objective evolutionary algorithms to optimize dynamic data types in embedded systems
New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target em...
José Ignacio Hidalgo, José L. Risco-...
111
Voted
SIGCOMM
2010
ACM
15 years 1 months ago
Rethinking iBGP routing
The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows ...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
ICDCS
2010
IEEE
15 years 1 months ago
Resource Allocation in Distributed Mixed-Criticality Cyber-Physical Systems
—Large-scale distributed cyber-physical systems will have many sensors/actuators (each with local micro-controllers), and a distributed communication/computing backbone with mult...
Karthik Lakshmanan, Dionisio de Niz, Ragunathan Ra...
118
Voted
AI
2007
Springer
15 years 1 months ago
An algorithm for distributing coalitional value calculations among cooperating agents
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
Talal Rahwan, Nicholas R. Jennings