Sciweavers

4218 search results - page 244 / 844
» Complete sets of cooperations
Sort
View
107
Voted
ICWE
2009
Springer
15 years 7 months ago
UWE4JSF: A Model-Driven Generation Approach for Web Applications
Model-driven engineering is a promising approach, but there are still many hurdles to overcome. The tool UWE4JSF solves the hurdles for the model-driven development of web applicat...
Christian Kroiss, Nora Koch, Alexander Knapp
78
Voted
ICMCS
2007
IEEE
140views Multimedia» more  ICMCS 2007»
15 years 7 months ago
Suspicious Behavior Detection in Public Transport by Fusion of Low-Level Video Descriptors
Recently great interest has been shown in the visual surveillance of public transportation systems. The challenge is the automated analysis of passenger’s behaviors with a set o...
Dejan Arsic, Björn Schuller, Gerhard Rigoll
115
Voted
ICOIN
2004
Springer
15 years 6 months ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
75
Voted
ECAI
1998
Springer
15 years 5 months ago
Metaprogramming Forced Moves
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
Tristan Cazenave
88
Voted
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
15 years 4 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...