Sciweavers

6554 search results - page 945 / 1311
» Constraint Logic Programming
Sort
View
COR
2006
95views more  COR 2006»
15 years 6 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
IEICET
2006
114views more  IEICET 2006»
15 years 6 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
JSAT
2006
88views more  JSAT 2006»
15 years 6 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
JMMA
2002
90views more  JMMA 2002»
15 years 5 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...