Sciweavers

1403 search results - page 102 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
SIAMJO
2008
72views more  SIAMJO 2008»
14 years 9 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
IPPS
1998
IEEE
15 years 2 months ago
Scheduling with Communication Delays and Data Routing in Message Passing Architectures
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
Aziz Moukrim, Alain Quilliot
ICC
2007
IEEE
103views Communications» more  ICC 2007»
15 years 4 months ago
A More Realistic Approach to Information-Theoretic Sum Capacity of Reverse Link CDMA Systems in a Single Cell
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
Arash Abadpour, Attahiru Sule Alfa, Anthony C. K. ...
CP
2004
Springer
15 years 1 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
CP
2005
Springer
15 years 3 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...