Sciweavers

700 search results - page 119 / 140
» On Termination of Constraint Logic Programs
Sort
View
AAAI
1994
15 years 11 days ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
ICASSP
2008
IEEE
15 years 5 months ago
Cooperative MIMO-beamforming for multiuser relay networks
In this paper, we develop a beamforming algorithm for multiuser MIMO-relaying wireless systems. We consider a relaying scenario with multiple sources transmitting to one or more d...
Amr El-Keyi, Benoît Champagne
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 5 months ago
Mapping the physical layer of radio standards to multiprocessor architectures
We are concerned with the software implementation of baseband processing for the physical layer of radio standards (“Software Defined Radio - SDR”). Given the constraints for ...
Cyprian Grassmann, Mathias Richter, Mirko Sauerman...
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 3 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 2 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski