Sciweavers

1331 search results - page 32 / 267
» Complexity bounds for zero-test algorithms
Sort
View
MP
1998
83views more  MP 1998»
13 years 7 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
CEC
2007
IEEE
14 years 2 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 9 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang