Sciweavers

1356 search results - page 21 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
CP
2001
Springer
14 years 8 hour ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 7 months ago
A New Email Retrieval Ranking Approach
Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking...
Samir AbdelRahman, Basma Hassan, Reem Bahgat
AAAI
2010
13 years 4 months ago
A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
Siamak (Moshen) Ravanbakhsh, Barnabás P&oac...
AIPS
2008
13 years 9 months ago
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
Miguel A. González, Camino R. Vela, Ramiro ...
ICCD
2002
IEEE
127views Hardware» more  ICCD 2002»
14 years 4 months ago
GPE: A New Representation for VLSI Floorplan Problem
In this paper, we propose a new representation of VLSI floorplan and building block problem. The representation is the generalization of Polish expression [1]. By proposing a new ...
Chang-Tzu Lin, De-Sheng Chen, Yi-Wen Wang