4781 search results - page 178 / 957 » Complexity at large |
EVOW
2010
Springer
14 years 1 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
ICMCS
2005
IEEE
14 years 4 months ago
2005
IEEE
Traditional design and test of complex multimedia systems involves a large number of test vectors and is a difficult and time-consuming task. The simulation times are prohibitivel...
HOLOMAS
2009
Springer
14 years 3 months ago
2009
Springer
The paper gives overview of a multi-agent real-time scheduler for the European operation of one of the largest rent-a-car company in the world. It describes requirements for schedu...
IPM
2006
13 years 10 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...