Sciweavers

2218 search results - page 10 / 444
» Testing Expressibility Is Hard
Sort
View
ETS
2006
IEEE
75views Hardware» more  ETS 2006»
13 years 7 months ago
Testing the pedagogical expressiveness of IMS
René van Es, Rob Koper
TSD
2007
Springer
14 years 1 months ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
PERVASIVE
2007
Springer
13 years 7 months ago
Securing Pocket Hard Drives
Inexpensive portable storage devices that are available in the market today have made it easier for users to carry data and programs with them and borrow computing platforms when ...
Nishkam Ravi, Chandra Narayanaswami, Mandayam T. R...
ECRTS
1999
IEEE
13 years 12 months ago
Cluster simulation-support for distributed development of hard real-time systems using TDMA-based communication
In the eld of safety-critical real-time systems the development of distributed applications for fault tolerance reasons is a common practice. Hereby the whole application is divid...
Thomas M. Galla, Roman Pallierer
ANOR
2010
123views more  ANOR 2010»
13 years 7 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria