Sciweavers

1968 search results - page 360 / 394
» The Complexity of Valued Constraint Models
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
13 years 8 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
WWW
2011
ACM
13 years 3 months ago
Mark my words!: linguistic style accommodation in social media
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
Cristian Danescu-Niculescu-Mizil, Michael Gamon, S...
JSS
2011
150views more  JSS 2011»
13 years 2 months ago
A novel general framework for automatic and cost-effective handling of recoverable temporal violations in scientific workflow sy
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
Xiao Liu, Zhiwei Ni, Zhangjun Wu, Dong Yuan, Jinju...
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
JUCS
2007
95views more  JUCS 2007»
13 years 8 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow