190 search results - page 10 / 38 » Can Programming Be Liberated, Period |
OL
2011
13 years 2 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
INFORMS
2006
13 years 7 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
COLCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
When two sponsoring organizations, working towards separate goals, can employ wireless sensor networks for a finite period of time, it can be efficiency-enhancing for the sponso...
USENIX
2001
13 years 8 months ago
2001
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
Functional reactive programming (FRP) has simple and powerful semantics, but has resisted efficient implementation. In particular, most past implementations have used demand-driv...