Sciweavers

21876 search results - page 4293 / 4376
» Computer game-flow design
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 3 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
CICLING
2001
Springer
14 years 3 months ago
Spatio-temporal Indexing in Database Semantics
In logic, the spatio-temporal location of a proposition is characterized precisely within a Cartesian system of space and time coordinates. This is suitable for characterizing the ...
Roland Hausser
COLT
2001
Springer
14 years 3 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
DIGITALCITIES
2001
Springer
14 years 3 months ago
Little Boxes, Glocalization, and Networked Individualism
Much thinking about digital cities is in terms of community groups. Yet, the world is composed of social networks and not of groups. This paper traces how communities have changed ...
Barry Wellman
HYBRID
2001
Springer
14 years 3 months ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas
« Prev « First page 4293 / 4376 Last » Next »