4438 search results - page 389 / 888 » The Case for Collaborative Programming |
149
Voted
MP
2006
15 years 7 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
151
click to vote
LISP
1998
15 years 6 months ago
1998
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
181
click to vote
EUROCAST
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
226
click to vote
MP
2011
15 years 2 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
191
click to vote
CAV
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...