Sciweavers

1300 search results - page 202 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
15 years 6 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
JAIR
2008
110views more  JAIR 2008»
14 years 9 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
IFIP12
2009
14 years 7 months ago
Defining a Task's Temporal Domain for Intelligent Calendar Applications
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
Anastasios Alexiadis, Ioannis Refanidis
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 2 months ago
Distributed and optimal reduced primal-dual algorithm for uplink OFDM resource allocation
— Orthogonal frequency division multiplexing (OFDM) is the key component of many emerging broadband wireless access standards. The resource allocation in OFDM uplink, however, is...
Xiao-Xin Zhang, Liang Chen, Jianwei Huang, Minghua...
INFOCOM
2012
IEEE
13 years 6 days ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...