Sciweavers

994 search results - page 42 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
136
Voted
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 7 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
97
Voted
CONCUR
2007
Springer
15 years 4 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
113
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
92
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 7 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
109
Voted
ICAC
2006
IEEE
15 years 6 months ago
The Laundromat Model for Autonomic Cluster Computing
Traditional High Performance Computing systems require extensive management and suffer from security and configuration problems. This paper presents a new clustermanagement syste...
Jacob Gorm Hansen, Eske Christiansen, Eric Jul