Sciweavers

1618 search results - page 268 / 324
» Testing random number generators
Sort
View
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 3 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
AI
2008
Springer
14 years 10 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
SIMPRA
2008
106views more  SIMPRA 2008»
14 years 9 months ago
CEST and MEST: Tools for the simulation of radio frequency electric discharges in waveguides
In this paper we present two software tools for the simulation of electron multiplication processes in radio frequency (RF) waveguides. The electric discharges are caused by the m...
Francisco Pérez, Juan de Lara, Luis Conde, ...
TIP
2008
287views more  TIP 2008»
14 years 9 months ago
3-D Object Recognition Using 2-D Views
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...
Wenjing Li, George Bebis, Nikolaos G. Bourbakis
TON
2008
103views more  TON 2008»
14 years 9 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh