Sciweavers

4171 search results - page 130 / 835
» Choice numbers of graphs
Sort
View
MABS
2000
Springer
15 years 10 months ago
Mapping the Envelope of Social Simulation Trajectories
Discovering and studying emergent phenomena are among the most important activities in social research. Replicating this phenomenon in "the lab" using simulation is an i...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
AUTOMATICA
2005
89views more  AUTOMATICA 2005»
15 years 6 months ago
Instrumental variable methods for closed-loop system identification
In this paper, several instrumental variable (IV) and instrumental variable-related methods for closed-loop system identification are considered and set in an extended IV framewor...
Marion Gilson, Paul M. J. Van den Hof
CISST
2004
144views Hardware» more  CISST 2004»
15 years 7 months ago
Interactive Flag Identification Using Image Retrieval Techniques
We propose an interactive system for identifying flags in photos taken from natural scenes. The system is interactive in two respects. First, because segmentation can be a difficu...
Eduardo Hart, Sung-Hyuk Cha, Charles C. Tappert
DM
2006
104views more  DM 2006»
15 years 6 months ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
16 years 46 min ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek