Sciweavers

1469 search results - page 40 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 7 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
ISCI
2008
117views more  ISCI 2008»
13 years 7 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao
ECAL
2007
Springer
14 years 1 months ago
Spatial Embedding and Complexity: The Small-World Is Not Enough
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
Christopher L. Buckley, Seth Bullock
EDM
2010
150views Data Mining» more  EDM 2010»
13 years 9 months ago
Modeling Learning Trajectories with Epistemic Network Analysis: A Simulation-based Investigation of a Novel Analytic Method for
Epistemic games are designed to help players develop domain-specific expertise that characterizes how professionals in a particular domain reason, communicate, and act [1, 11]. To ...
Andre A. Rupp, Shauna J. Sweet, Younyoung Choi
NIPS
2007
13 years 9 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer