Sciweavers

9842 search results - page 402 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IPL
2006
79views more  IPL 2006»
15 years 4 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 4 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
131
Voted
IPL
2007
69views more  IPL 2007»
15 years 4 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen
134
Voted
AI
2000
Springer
15 years 4 months ago
BIG: An agent for resource-bounded information gathering and decision making
The World Wide Web has become an invaluable information resource but the explosion of available information has made web search a time consuming and complex process. The large num...
Victor R. Lesser, Bryan Horling, Frank Klassner, A...
133
Voted
ISPW
2010
IEEE
15 years 9 months ago
Software Factories: Describing the Assembly Process
Software Factories pose a paradigm shift that promises to turn application assembly more cost eective through systematic reuse. These advances in software industrialization have h...
Maider Azanza, Oscar Díaz, Salvador Trujill...