Sciweavers

6833 search results - page 322 / 1367
» Some two-character sets
Sort
View
155
Voted
IRI
2007
IEEE
16 years 1 months ago
Reducing hard SAT instances to polynomial ones
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
Olivier Fourdrinoy, Éric Grégoire, B...
IROS
2007
IEEE
164views Robotics» more  IROS 2007»
16 years 1 months ago
Analysis of indeterminate contact forces in robotic grasping and contact tasks
— In this paper, we analyze indeterminate contact forces in robotic grasping and contact tasks. Previous studies by Omata and Nagata showed that there is a constraint on static f...
Yusuke Maeda, Koutarou Oda, Satoshi Makita
LICS
2007
IEEE
16 years 1 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
CICLING
2007
Springer
16 years 29 days ago
Handling Conjunctions in Named Entities
Although the literature contains reports of very high accuracy figures for the recognition of named entities in text, there are still some named entity phenomena that remain probl...
Robert Dale, Pawel P. Mazur
HOLOMAS
2007
Springer
16 years 28 days ago
Auctions with Arbitrary Deals
To come to a deal, a bargaining process can sometimes take a long time. An auction may be a faster, but existing auction models cannot cope with situations where money is not an is...
Tamás Máhr, Mathijs de Weerdt