Sciweavers

1712 search results - page 40 / 343
» A Computational Approach to Binding Theory
Sort
View
DEXAW
2004
IEEE
111views Database» more  DEXAW 2004»
15 years 3 months ago
A Complex Systems Approach to Service Discovery
Complex systems are those systems composed of many, often very simple, interacting autonomous entities. Interactions between these entities give rise to behaviour and patterns at t...
Ricky Robinson, Jadwiga Indulska
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
15 years 6 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
ICRA
1998
IEEE
118views Robotics» more  ICRA 1998»
15 years 4 months ago
A General Theory for Positioning and Orienting 2D Polygonal or Curved Parts using Intelligent Motion Surfaces
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
Murilo G. Coutinho, Peter M. Will
CIE
2005
Springer
15 years 5 months ago
Towards Computability of Higher Type Continuous Data
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
Margarita V. Korovina, Oleg V. Kudinov
ENC
2008
IEEE
15 years 6 months ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...