Sciweavers

2949 search results - page 390 / 590
» Universal Sparse Modeling
Sort
View
SAC
2006
ACM
14 years 4 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
SIGCSE
2006
ACM
170views Education» more  SIGCSE 2006»
14 years 4 months ago
MARS: an education-oriented MIPS assembly language simulator
We describe the implementation of “MARS,” a GUI, Java-based simulator for the MIPS assembly language. MIPS, the computer architecture underlying the simulated assembly languag...
Kenneth Vollmar, Pete Sanderson
CEC
2005
IEEE
14 years 4 months ago
An empirical analysis of the grouping genetic algorithm: the timetabling case
A grouping genetic algorithm (GGA) for the university course timetabling problem is outlined. We propose six different fitness functions, all sharing the same common goal, and look...
Rhydian Lewis, Ben Paechter
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
14 years 4 months ago
An Approach for Intent Identification by Building on Deception Detection
Past research in deception detection at the University of Arizona has guided the investigation of intent detection. A theoretical foundation and model for the analysis of intent d...
Judee K. Burgoon, Mark Adkins, John Kruse, Matthew...
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
14 years 4 months ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud