Sciweavers

789 search results - page 87 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
15 years 3 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
202
Voted
HCW
2000
IEEE
15 years 7 months ago
Evaluation of PAMS' Adaptive Management Services
Management of large-scale parallel and distributed applications is an extremely complex task due to factors such as centralized management architectures, lack of coordination and ...
Yoonhee Kim, Salim Hariri, Muhamad Djunaedi
164
Voted
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 9 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 5 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
143
Voted
ICTAI
2002
IEEE
15 years 8 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali