Sciweavers

1816 search results - page 240 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
MFCS
2009
Springer
16 years 1 months ago
Private Capacities in Mechanism Design
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
SAT
2009
Springer
132views Hardware» more  SAT 2009»
16 years 1 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ICPP
2005
IEEE
16 years 4 days ago
Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
IWQOS
2005
Springer
16 years 22 hour ago
A High-Throughput Overlay Multicast Infrastructure with Network Coding
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
Mea Wang, Zongpeng Li, Baochun Li
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 10 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang