Sciweavers

1984 search results - page 49 / 397
» The colourful feasibility problem
Sort
View
DIS
2004
Springer
14 years 3 months ago
Privacy Problems with Anonymized Transaction Databases
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
Taneli Mielikäinen
IPPS
1999
IEEE
14 years 2 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
COR
2008
133views more  COR 2008»
13 years 9 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
IPPS
1999
IEEE
14 years 2 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
AIPS
2008
14 years 8 days ago
A New Local Search for the Job Shop Problem with Uncertain Durations
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
Inés González Rodríguez, Cami...