Sciweavers

10493 search results - page 180 / 2099
» Dynamic Word Problems
Sort
View
NIPS
2007
13 years 9 months ago
Spatial Latent Dirichlet Allocation
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
Xiaogang Wang, Eric Grimson
GECCO
2009
Springer
14 years 24 days ago
Problem decomposition using indirect reciprocity in evolved populations
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
Heather Goldsby, Sherri Goings, Jeff Clune, Charle...
DFG
2003
Springer
14 years 1 months ago
Inheritance of Business Processes: A Journey Visiting Four Notorious Problems
Abstract. The new millennium is characterized by speed and distribution in every aspect of most business and organization undertaking. Organizations are challenged to bring ideas a...
Wil M. P. van der Aalst
SC
1994
ACM
14 years 7 days ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
14 years 2 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason