881 search results - page 161 / 177 » Solving satisfiability problems with preferences |
TSMC
2010
13 years 2 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
BALT
2006
13 years 11 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
AI
2008
Springer
13 years 7 months ago
2008
Springer
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
EOR
2006
13 years 7 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...