Sciweavers

6833 search results - page 343 / 1367
» Some two-character sets
Sort
View
CN
2007
124views more  CN 2007»
15 years 6 months ago
Cryptographic techniques for mobile ad-hoc networks
In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New ...
Vanesa Daza, Javier Herranz, Paz Morillo, Carla R&...
JAIR
2008
120views more  JAIR 2008»
15 years 6 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
202
Voted
COR
2007
79views more  COR 2007»
15 years 6 months ago
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 6 months ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean
JAPLL
2006
114views more  JAPLL 2006»
15 years 6 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle