Sciweavers

12766 search results - page 2472 / 2554
» collective
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 6 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
RTS
2002
154views more  RTS 2002»
15 years 6 months ago
Flexible Soft Real-Time Processing in Middleware
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
Scott A. Brandt, Gary J. Nutt
SPE
1998
129views more  SPE 1998»
15 years 6 months ago
Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
Brian W. Kernighan, Christopher J. Van Wyk
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 6 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 6 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
« Prev « First page 2472 / 2554 Last » Next »