14158 search results - page 84 / 2832 » Generalized switch-setting problems |
JDA
2010
15 years 23 days ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
134
click to vote
LICS
2010
IEEE
15 years 23 days ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
158
click to vote
ICONFERENCE
2011
14 years 9 months ago
2011
To develop a science of small-group interaction in groupware, we need a method for analyzing the structure of computer-mediated discourse. Conversation analysis offers an analysis...
129
click to vote
JMLR
2010
14 years 9 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
167
click to vote
VLUDS
2010
14 years 9 months ago
2010
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...