Sciweavers

2638 search results - page 126 / 528
» Random Geometric Complexes
Sort
View
AAAI
2006
15 years 8 months ago
Constraint-Based Random Stimuli Generation for Hardware Verification
We report on random stimuli generation for hardware verification in IBM as a major application of various artificial intelligence technologies, including knowledge representation,...
Yehuda Naveh, Michal Rimon, Itai Jaeger, Yoav Katz...
ISCIS
2005
Springer
16 years 8 days ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
MFCS
2005
Springer
16 years 8 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
WSC
2007
15 years 9 months ago
Using empirical demand data and common random numbers in an agent-based simulation of a distribution network
Agent-based simulation provides a methodology to investigate complex systems behavior, such as supply chains, while incorporating many empirical elements relative to both systems ...
William J. Sawaya
ICIP
2007
IEEE
16 years 8 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach