6031 search results - page 1173 / 1207 » Communicating Transaction Processes |
126
click to vote
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
119
click to vote
COSIT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present results from a series of experiments, where relevant factors for the use of path prepositions were examined. We were especially interested in the concepts behi...
ICSE
2001
IEEE-ACM
15 years 6 months ago
2001
IEEE-ACM
It has long been accepted that requirements analysis should precede architectural design and implementation, but in software evolution and reverse engineering this concern with bl...
130
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
AGENTS
2000
Springer
15 years 6 months ago
2000
Springer
Multi-agent systems are prone to failures typical of any distributed system. Agents and resources may become unavailable due to machine crashes, communication breakdowns, process ...