Sciweavers

937 search results - page 164 / 188
» On the Complexity of Partial Order Properties
Sort
View
ISVC
2010
Springer
14 years 8 months ago
Using R-Trees for Interactive Visualization of Large Multidimensional Datasets
Large, multidimensional datasets are difficult to visualize and analyze. Visualization interfaces are constrained in resolution and dimension, so cluttering and problems of project...
Alfredo Giménez, René Rosenbaum, Mar...
JAIR
2010
82views more  JAIR 2010»
14 years 8 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
GI
2010
Springer
14 years 8 months ago
Cloud Computing for Autonomous Control in Logistics
Abstract: Logistics processes in a globalised economy are increasingly complex, dynamic, and distributed. These properties pose major challenges for logistics planning and control....
Arne Schuldt, Karl Hribernik, Jan D. Gehrke, Klaus...
GLOBECOM
2010
IEEE
14 years 8 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo