Sciweavers

3256 search results - page 436 / 652
» Mixin-Based Programming in C
Sort
View
125
Voted
CCCG
2009
15 years 1 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
SIGCOMM
2010
ACM
15 years 25 days ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
AUTOMATICA
2008
60views more  AUTOMATICA 2008»
15 years 22 days ago
Control of nonstationary LPV systems
This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. I...
Mazen Farhood, Geir E. Dullerud
101
Voted
CCR
2008
90views more  CCR 2008»
15 years 22 days ago
Open issues in organizing computer systems conferences
The Workshop on Organizing Workshops, Conferences, and Symposia for Computer Systems (WOWCS) was organized to "bring together conference organizers (past, present, and future...
Jeffrey C. Mogul, Tom Anderson
130
Voted
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
15 years 21 days ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper