Sciweavers

1677 search results - page 214 / 336
» On the Completeness of Quantum Computation Models
Sort
View
AIPS
2011
14 years 10 months ago
Planning and Acting in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
Christopher Weber, Daniel Bryce
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
16 years 23 days ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
ICRA
2000
IEEE
165views Robotics» more  ICRA 2000»
15 years 10 months ago
An Approach to Rapid Manufacturing with Custom Fixturing
We present an approach for automatically generating complete process plans, including xturing and CNC code, from high level shape feature part descriptions. The demonstration syst...
Mark Bloomenthal, Richard F. Riesenfeld, Elaine Co...
EJC
2008
15 years 7 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser
ECCC
2011
202views ECommerce» more  ECCC 2011»
15 years 1 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain