Sciweavers

2182 search results - page 158 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
MFCS
2009
Springer
14 years 3 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
IFIP
2004
Springer
14 years 2 months ago
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
Hubert Schmid, Thomas Worsch
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 2 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 9 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 3 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen