Sciweavers

1566 search results - page 75 / 314
» On a Cone Covering Problem
Sort
View
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 9 months ago
Document Management as a Database Problem
abstract of invited paper Document management has many aspects, among them acquisition, storage, retrieval, presentation and processing of documents (work flow). These aspects will...
Rudolf Bayer
SIAMJO
2010
92views more  SIAMJO 2010»
15 years 28 days ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta
MOR
2002
102views more  MOR 2002»
15 years 5 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
FSTTCS
2010
Springer
15 years 4 months ago
Place-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
Rémi Bonnet, Alain Finkel, Jérô...
VSTTE
2012
Springer
14 years 1 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...