Sciweavers

1816 search results - page 31 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
PRICAI
2004
Springer
15 years 5 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
ICASSP
2011
IEEE
14 years 3 months ago
Cooperative Maximum Likelihood estimation for fluid flow dynamics in biosensor arrays
Abstract—This paper deals with estimation of the concentration of target molecules in a fluid when it flows past multiple biosensors. The fluid flow is modelled as an advecti...
Maryam Abolfath Beygi, Vikram Krishnamurthy
IJCAI
2001
15 years 1 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
CONSTRAINTS
2011
14 years 6 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 11 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...