146 search results - page 11 / 30 » SAT-Based Complete Don't-Care Computation for Network Optimi... |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
CF
2004
ACM
14 years 26 days ago
2004
ACM
Pervasive computing applications allow users to access information from anywhere while traveling and using variety of devices. Heterogeneity and limitation of resources involved i...
COLCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— While multicast has been studied extensively in many domains such as content streaming and file sharing, there is little research applying it to synchronous collaborations invo...
IMC
2004
ACM
14 years 26 days ago
2004
ACM
The capacity of today's network links, along with the heterogeneity of their traffic, is rapidly growing, more than the workstation’s processing power. This makes the task ...
CVPR
2003
IEEE
14 years 21 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...