Sciweavers

1197 search results - page 232 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
UIST
2004
ACM
14 years 1 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
JACIII
2007
99views more  JACIII 2007»
13 years 7 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
ATAL
2007
Springer
13 years 12 months ago
Resolving conflict and inconsistency in norm-regulated virtual organizations
Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openn...
Wamberto Weber Vasconcelos, Martin J. Kollingbaum,...
ICDCS
2005
IEEE
14 years 1 months ago
Optimal Component Composition for Scalable Stream Processing
Stream processing has become increasingly important with emergence of stream applications such as audio/video surveillance, stock price tracing, and sensor data analysis. A challe...
Xiaohui Gu, Philip S. Yu, Klara Nahrstedt
COMGEO
2008
ACM
13 years 8 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...