13841 search results - page 296 / 2769 » Algorithms and Constraint Programming |
158
Voted
NIPS
2008
15 years 8 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
172
click to vote
SIAMJO
2000
15 years 6 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
234
click to vote
CPM
1998
Springer
15 years 11 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
178
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
174
click to vote
LOPSTR
2005
Springer
16 years 5 days ago
2005
Springer
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...