Sciweavers

2583 search results - page 297 / 517
» On the Representation of Timed Polyhedra
Sort
View
IJFCS
2007
93views more  IJFCS 2007»
15 years 6 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
AIR
2005
119views more  AIR 2005»
15 years 6 months ago
An Assessment of Case-Based Reasoning for Spam Filtering
Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work...
Sarah Jane Delany, Padraig Cunningham, Lorcan Coyl...
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 6 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CAD
2005
Springer
15 years 6 months ago
Shape-based searching for product lifecycle applications
Estimates suggest that more than 75% of engineering design activity comprises reuse of previous design knowledge to address a new design problem. Reusing design knowledge has grea...
Natraj Iyer, Subramaniam Jayanti, Kuiyang Lou, Yag...
CGF
2005
100views more  CGF 2005»
15 years 6 months ago
Semanticons: Visual Metaphors as File Icons
Semanticons can enhance the representation of files by offering symbols that are both meaningful and easily distinguishable. The semantics of a file is estimated by parsing its na...
Vidya Setlur, Conrad Albrecht-Buehler, Amy Ashurst...