Sciweavers

421 search results - page 43 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
14 years 28 days ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
COMCOM
2008
151views more  COMCOM 2008»
13 years 7 months ago
Joint bandwidth allocation, element assignment and scheduling for wireless mesh networks with MIMO links
With the unique features of spatial multiplexing and interference suppression, Multiple Input Multiple Output (MIMO) techniques have great potential in the improvement of network ...
Jun Wang, Peng Du, Weijia Jia, Liusheng Huang, Hua...
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
JAL
2000
82views more  JAL 2000»
13 years 7 months ago
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
Rolf Niedermeier, Peter Rossmanith
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...