Sciweavers

920 search results - page 27 / 184
» Generating Satisfiable Problem Instances
Sort
View
CADE
2007
Springer
14 years 10 months ago
Encoding First Order Proofs in SAT
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin,...
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 3 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
ICFEM
2009
Springer
14 years 4 months ago
Symbolic Query Exploration
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
DCC
2007
IEEE
14 years 10 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
4OR
2008
96views more  4OR 2008»
13 years 10 months ago
A column generation approach to train timetabling on a corridor
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Valentina Cacchiani, Alberto Caprara, Paolo Toth