Sciweavers

1568 search results - page 76 / 314
» The problem of examination questions in algorithmics
Sort
View
ICS
2010
Tsinghua U.
16 years 1 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
ECSCW
2001
15 years 5 months ago
On finding things out: Situating organisational knowledge in CSCW
We present a field study of an organisation which designs and constructs precision mechatronic devices, which typically integrate electronics, mechanical assemblies, computer hardw...
Kristina Groth, John Bowers
JECR
2002
220views more  JECR 2002»
15 years 3 months ago
Usability for Mobile Commerce Across Multiple Form Factors
Current research on usability for mobile commerce has focused on single platforms and very limited aspects of commerce activities. We conducted an exploratory study to examine usa...
Susy S. Chan, Xiaowen Fang, Jack R. Brzezinski, Ya...
129
Voted
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 7 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen
ATAL
2008
Springer
15 years 6 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings