Sciweavers

2061 search results - page 281 / 413
» Authorization for Metacomputing Applications
Sort
View
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
15 years 9 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
HICSS
2003
IEEE
109views Biometrics» more  HICSS 2003»
15 years 9 months ago
Towards a Structurational Theory of Information Systems: A Substantive Case Analysis
This paper employs the analysis of an interpretive case study within a Regional Train Operating Company (RTOC) to arrive at theoretical understandings of Information Systems (IS)....
Jeremy Rose, Ray Hackney
ICDCSW
2003
IEEE
15 years 9 months ago
Entry Points into a Smart Campus Environment - Overview of the ETHOC System
The university campus is an interesting application environment for the ubiquitous computing paradigm: a large number of users share a substantial amount of their information need...
Michael Rohs, Jürgen Bohn
130
Voted
ICTAI
2003
IEEE
15 years 9 months ago
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic alg...
Sushil J. Louis, Gary L. Raines
ICTAI
2003
IEEE
15 years 9 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...