Sciweavers

MMB
2012
Springer
259views Communications» more  MMB 2012»
12 years 4 days ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
ECCC
2011
190views ECommerce» more  ECCC 2011»
12 years 8 months ago
Optimal heuristic algorithms for the image of an injective function
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...

0
posts
with
0
views
204profile views
gomgcrResearch Scientist, PhD
AT&T Labs Research
gomgcr
Mauricio G. C. Resende is a research scientist at the Algorithms and Optimization Research Department at the AT&T Shannon Laboratory of AT&T Labs Research. His undergraduate studie...
COMCOM
2007
123views more  COMCOM 2007»
13 years 4 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla
JUCS
2006
101views more  JUCS 2006»
13 years 4 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
EOR
2007
147views more  EOR 2007»
13 years 4 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
EOR
2007
76views more  EOR 2007»
13 years 4 months ago
Lower bounds and heuristics for the Windy Rural Postman Problem
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
Enrique Benavent, Alessandro Carrotta, Angel Corbe...
COMCOM
2006
100views more  COMCOM 2006»
13 years 4 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
ATAL
2010
Springer
13 years 5 months ago
Adversarial planning for large multi-agent simulations
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
Viliam Lisý
DCOSS
2008
Springer
13 years 6 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...