Sciweavers

6562 search results - page 8 / 1313
» Noetherianity and Combination Problems
Sort
View
ICCBR
2009
Springer
14 years 2 months ago
Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
Samad Valipour Shokouhi, Agnar Aamodt, Pål S...
CSCLP
2007
Springer
14 years 3 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
COR
2007
103views more  COR 2007»
13 years 9 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
CEC
2005
IEEE
14 years 3 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
13 years 9 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...