Sciweavers

3495 search results - page 163 / 699
» On the random satisfiable process
Sort
View
ICIS
1997
15 years 5 months ago
A case study of user participation in the information systems development process
There are many in the information systemsdiscipline who believe that user participation is necessary for successful systems development. However, it has been suggested that this b...
Thomas Butler, Brian Fitzgerald
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
AAAI
2006
15 years 6 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
JUCS
2006
114views more  JUCS 2006»
15 years 4 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...