Sciweavers

3267 search results - page 412 / 654
» Generalized quasirandom graphs
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
16 years 6 days ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
UIST
2005
ACM
16 years 6 days ago
Supporting interaction in augmented reality in the presence of uncertain spatial knowledge
A significant problem encounteredwhen building Augmented Reality (AR) systems is that all spatial knowledge about the world has uncertainty associated with it. This uncertainty m...
Enylton Machado Coelho, Blair MacIntyre, Simon Jul...
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
16 years 5 days ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
ATAL
2005
Springer
16 years 5 days ago
Formation of cooperation structure by interaction network in directed multi-agent
A directed agent implies an agent with high constraints in both recognition and motion. Because of the embodied restrictions, the directed agent perceives a sense of subjective di...
Kosuke Sekiyama, Yukihisa Okade
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
16 years 5 days ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...