Sciweavers

1795 search results - page 154 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICMCS
2000
IEEE
91views Multimedia» more  ICMCS 2000»
14 years 1 months ago
Distributed QoS Routing for Multimedia Traffic
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
Venkatesh Sarangan, Donna Ghosh, Raj Acharya
DAC
1996
ACM
14 years 1 months ago
Tutorial: Design of a Logic Synthesis System
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
Richard L. Rudell
ESWS
2007
Springer
14 years 26 days ago
Semantic Group Formation
Many approaches to learning and teaching rely upon students working in groups. Formation of optimal groups can be a time consuming and complex task, particularly when the list of ...
Asma Ounnas
BROADNETS
2004
IEEE
14 years 22 days ago
Power Efficient Broadcast Scheduling with Delay Deadlines
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang
AUSAI
2006
Springer
14 years 22 days ago
Logical Properties of Belief-Revision-Based Bargaining Solution
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
Dongmo Zhang, Yan Zhang