Sciweavers

21324 search results - page 403 / 4265
» Making the case for computing
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
IWANN
2009
Springer
15 years 9 months ago
A Soft Computing System to Perform Face Milling Operations
In this paper we present a soft computing system developed to optimize the face milling operation under High Speed conditions in the manufacture of steel components like molds with...
Raquel Redondo, Pedro Santos, Andrés Bustil...
INFOCOM
1997
IEEE
15 years 9 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
166
Voted
CASES
2008
ACM
15 years 7 months ago
Dynamic coprocessor management for FPGA-enhanced compute platforms
Various commercial programmable compute platforms have their processor architecture enhanced with field-programmable gate arrays (FPGAs). In a common usage scenario, an applicatio...
Chen Huang, Frank Vahid
FLAIRS
2004
15 years 6 months ago
Natural Language Generation and Discourse Context: Computing Distractor Sets from the Focus Stack
In human-human conversation, people use linguistic expressions that are flexibly tailored to context as a matter of course, and they expect their conversational partners to do lik...
David DeVault, Charles Rich, Candace L. Sidner