نتایج جستجو برای: many factors

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

2002
Chris Preist Carlos Mérida-Campos

In this paper, we present an agent which is able to negotiate the buying and selling of imperfectly sustitutable goods in a double auction style market. Two goods are said to be imperfectly substitutable if a buyer can use either of them, but prefers one over the other. For example, an electronics manufacturer using a RAM chip can use many suppliers to do this but may be willing to pay a premiu...

Journal: :CoRR 2017
Joachim Neu Anas Chaaban Aydin Sezgin Mohamed-Slim Alouini

The characterization of fundamental performance bounds of many-to-many communication systems in which participating nodes are active in an intermittent way is one of the major challenges in communication theory. In order to address this issue, we introduce the multiple-input multiple-output (MIMO) three-way channel (3WC) with an intermittent node and study its degrees-of-freedom (DoF) region an...

Journal: :Graphs and Combinatorics 2007
Justin Colannino Mirela Damian Ferran Hurtado Stefan Langerman Henk Meijer Suneeta Ramaswami Diane L. Souvaine Godfried T. Toussaint

[email protected] 2 Department of Computer Science, Villanova University, Villanova, USA. e-mail: [email protected] 3 Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain. Partially supported by projects MCYT BFM2003-00368, MEC MTM2006-01267 and Gen. Cat. 2005SGR00692. e-mail: [email protected] 4 Chercheur qualifié du FNRS, Département d...

Journal: :Algebraic & Geometric Topology 2014

Journal: :JALA: Journal of the Association for Laboratory Automation 2004

Journal: :Mathematische Annalen 2023

Abstract We show that for fixed $$d&gt;3$$ d &gt; 3 and n growing to infinity there are at least $$(n!)^{d-2 \pm o(1)}$$ ( n ! ) - 2 <mml:mo...

2006
Liam Pedersen William J. Clancey Maarten Sierhuis Nicola Muscettola David E. Smith David Lees Kanna Rajan Sailesh Ramakrishnan Paul Tompkins Alonso Vera Tom Dayton

We demonstrated integrated technology for multiple crew and robots to work together in a planetary surface exploration scenario. Highlights include dynamic replanning, “many to many” rover commanding, efficient human-system interaction and workflows, single cycle instrument placement, and data management.

2012
Katarzyna E. Paluch

Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties, and each agent and house has their capacity denoting the maximum number of houses/agents (respectively) that can be matched to him/her/it. We want to find a matching M , called popular, for which there is no other matching M ′ such that more agents prefer M ′ to M than M to M ′, sub...

2003
Sven Wachsmuth Suzanne Stevenson Sven Dickinson

We present on-goingwork on the topic of learning translation models between image data and text (English) captions. Most approaches to this problem assume a one-to-one or a flat, oneto-many mapping between a segmented image region and a word. However, this assumption is very restrictive from the computer vision standpoint, and fails to account for two important properties of image segmentation:...

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

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