3433 search results - page 260 / 687 » Heuristics for a bidding problem |
170
click to vote
AIR
2008
15 years 6 months ago
2008
This paper is concerned with taking an engineering approach towards the application of metaheuristic problem solving methods, i.e. heuristics that aim to solve a wide variety of p...
137
click to vote
SEMWEB
2007
Springer
16 years 25 days ago
2007
Springer
Mapping ontologies with high precision on the Semantic Web is a challenging problem that needs to be addressed in various domains. One of the main problems with any mapping process...
162
click to vote
COMPSAC
2006
IEEE
16 years 23 days ago
2006
IEEE
As software systems evolve by adding new extensions some unexpected conflicts may occur, which is known as the Feature Interaction Problem (FIP). FIP is a threat to the dependabil...
141
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we w...
143
click to vote
ASPDAC
2000
ACM
15 years 10 months ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...