Sciweavers

874 search results - page 129 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
116
Voted
ICALP
2003
Springer
15 years 7 months ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...
118
Voted
CVPR
2008
IEEE
16 years 4 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
EICS
2010
ACM
15 years 7 months ago
Letras: an architecture and framework for ubiquitous pen-and-paper interaction
Paper remains a prevalent medium in mobile usage contexts due to its inherent flexibility and robustness. Mobile computing solutions begin to provide powerful and convenient func...
Felix Heinrichs, Jürgen Steimle, Daniel Schre...
COMPSAC
1998
IEEE
15 years 6 months ago
M-base: Enduser-Initiative Application Development Based on Message Flow and Componentware
Explosive increase in enduser computing on distributed systems requires that endusers develop application software by themselves. One solution is given as a formula of "a dom...
Takeshi Chusho, Mitsuyoshi Matsumoto, Yuji Konishi
133
Voted
MFCS
2005
Springer
15 years 8 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher