نتایج جستجو برای: feasible answer

تعداد نتایج: 160215  

2006
Alejandra López

We present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse.

2004
Milan Milosevic

. . . . . . . . . . . . . . . . . . . . . . . . . . 366

2010
Yves Moinard

We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanations from causal information. We show the naturalness and relative efficiency of this translation job. We are interested in the ease for writing an ASP program. Limitations of the earlier systems made that in practice, th...

2016
Sam Sloate Vincent Hsiao Nina Charness Ethan Lowman Chris Maxey Guannan Ren Nathan Fields Leora Morgenstern

Tables in technical papers often provide much useful information that is not present in text. This paper focuses on the specific problem of automated table reading (ATR): automating the interpretation and extraction of information from proteinreaction information (PRI) tables in the molecular biology literature (MBL), in the context of a general knowledge-based approach to automating table read...

2000
Jose C. Principe Qun Zhao Dongxin Xu

This paper describes a new architecture for ATR classifiers based on the premise that the pose of the target is known within a precision of 10 degrees. We recently developed such a pose estimator. The advantage of our classifier is that the input space complexity is decreased by the information of the pose, which enables fewer features to classify targets with higher degree of accuracy. Moreove...

2000
Steven P. Abney Michael Collins Amit Singhal

Information retrieval systems have typically concentrated on retrieving a set of documents which are relevant to a user’s query. This paper describes a system that attempts to retrieve a much smaller section of text, namely, a direct answer to a user’s question. The SMART IR system is used to extract a ranked set of passages that are relevant to the query. Entities are extracted from these pass...

Journal: :Int. J. Game Theory 2009
Michele Lombardi Marco Mariotti

An uncovered bargaining solution is a bargaining solution for which there exists a complete and strict relation (tournament) such that, for each feasible set, the bargaining solution set coincides with the uncovered set of the tournament. We provide a characterization of a class of uncovered bargaining solutions. J.E.L. codes: C72, D44.

1996
Alan R. Dennis Jay E. Aronson William G. Heninger Edward D. Walker

One aspect of brainstorming that has received little research attention is how the brainstorming task should be presented to the group, whether as one allencompassing question or as a series of separate questions each focusing on one aspect of the task. This paper reports the results of an experiment in which groups electronically brainstormed on intact tasks (where all parts of the task were p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید