Sciweavers

3367 search results - page 169 / 674
» Incremental assignment problem
Sort
View
JCO
1998
97views more  JCO 1998»
15 years 6 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
ICIP
2010
IEEE
15 years 4 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan
BERTINORO
2005
Springer
15 years 12 months ago
Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by bidirectional links and the total powe...
Roberto Montemanni, Luca Maria Gambardella
EURODAC
1995
IEEE
133views VHDL» more  EURODAC 1995»
15 years 10 months ago
Tree restructuring approach to mapping problem in cellular-architecture FPGAs
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
Naveen Ramineni, Malgorzata Chrzanowska-Jeske, Nav...
ETS
2000
IEEE
154views Hardware» more  ETS 2000»
15 years 6 months ago
Task Structuring for On-line Problem Based Learning: A Case Study
Getting students to collaborate on group projects in a face-to-face scenario can be difficult enough -- but how does one approach collaborative projects in a Web-based environment...
Vanessa Paz Dennen