Sciweavers

3433 search results - page 280 / 687
» Heuristics for a bidding problem
Sort
View
IJCAI
1997
15 years 8 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 6 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani
JUCS
2006
101views more  JUCS 2006»
15 years 6 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
TCAD
2008
103views more  TCAD 2008»
15 years 6 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni