Sciweavers

4420 search results - page 183 / 884
» Evaluating a Computational Model of Emotion
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-...
IPPS
2009
IEEE
16 years 1 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
AUTOMOTIVEUI
2009
ACM
16 years 1 months ago
A cognitive schema approach to diagnose intuitiveness: an application to onboard computers
Intuitive use is met when prior knowledge is transferred to new task environments. The empirical fact that transfer relies on schemas led us to diagnose intuitiveness based on sch...
Sandrine Fischer, Makoto Itoh, Toshiyuki Inagaki
FOCS
2008
IEEE
16 years 1 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ASIACRYPT
2005
Springer
16 years 22 days ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen