Sciweavers

4114 search results - page 19 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
KES
2005
Springer
15 years 9 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
MONET
2002
120views more  MONET 2002»
15 years 3 months ago
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree c...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
IPL
2010
158views more  IPL 2010»
15 years 1 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
15 years 7 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
CSUR
1999
74views more  CSUR 1999»
15 years 3 months ago
Algorithm Engineering
Algorithm Engineering is concerned with the design, analysis, implementation, tuning, debugging and experimental evaluation of computer programs for solving algorithmic problems. ...
Giuseppe Cattaneo, Giuseppe F. Italiano