1802 search results - page 214 / 361 » Complexity Theory for Operators in Analysis |
160
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
160
click to vote
AAAI
1990
15 years 7 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
191
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
150
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
235
click to vote
WKDD
2010
CPS
15 years 4 months ago
2010
CPS
In physics, structure of glass and ion trajectories are essentially based on statistical analysis of data acquired through experimental measurement and computer simulation [1, 2]. ...