Sciweavers

17329 search results - page 41 / 3466
» Improved non-approximability results
Sort
View
ORL
2007
81views more  ORL 2007»
13 years 8 months ago
An improved probability bound for the Approximate S-Lemma
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism resu...
Kürsad Derinkuyu, Mustafa Ç. Pinar, Ah...
IPL
2011
112views more  IPL 2011»
13 years 3 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
JCIT
2010
162views more  JCIT 2010»
13 years 3 months ago
Traffic Prediction Based on Improved Neural Network
Artificial neural networks and genetic algorithms derived from the corresponding simulation of biology, anatomy. The paper analyzes the advantages and the disadvantages of the art...
Jian-ming Cui
CHI
2011
ACM
13 years 7 days ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais
RTS
2010
134views more  RTS 2010»
13 years 7 months ago
Improved multiprocessor global schedulability analysis
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...